/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:34:24,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:34:24,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:34:24,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:34:24,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:34:24,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:34:24,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:34:24,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:34:24,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:34:24,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:34:24,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:34:24,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:34:24,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:34:24,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:34:24,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:34:24,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:34:24,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:34:24,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:34:24,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:34:24,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:34:24,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:34:24,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:34:24,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:34:24,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:34:24,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:34:24,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:34:24,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:34:24,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:34:24,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:34:24,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:34:24,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:34:24,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:34:24,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:34:24,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:34:24,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:34:24,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:34:24,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:34:24,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:34:24,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:34:24,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:34:24,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:34:24,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:34:24,354 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:34:24,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:34:24,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:34:24,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:34:24,356 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:34:24,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:34:24,356 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:34:24,357 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:34:24,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:34:24,358 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:34:24,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:34:24,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:34:24,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:34:24,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:34:24,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:34:24,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:34:24,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:34:24,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:34:24,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:34:24,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:34:24,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:34:24,360 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:34:24,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:34:24,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:34:24,360 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:34:24,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:34:24,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:34:24,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:34:24,683 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:34:24,683 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:34:24,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2021-03-26 00:34:24,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7eb0f92/2d7bfcda6dc14329b03eab170755b8ee/FLAGef390219e [2021-03-26 00:34:25,222 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:34:25,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2021-03-26 00:34:25,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7eb0f92/2d7bfcda6dc14329b03eab170755b8ee/FLAGef390219e [2021-03-26 00:34:25,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7eb0f92/2d7bfcda6dc14329b03eab170755b8ee [2021-03-26 00:34:25,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:34:25,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:34:25,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:34:25,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:34:25,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:34:25,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f538ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25, skipping insertion in model container [2021-03-26 00:34:25,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:34:25,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:34:25,476 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/safe003_power.opt.i[951,964] [2021-03-26 00:34:25,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:34:25,624 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:34:25,634 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/safe003_power.opt.i[951,964] [2021-03-26 00:34:25,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:34:25,767 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:34:25,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25 WrapperNode [2021-03-26 00:34:25,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:34:25,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:34:25,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:34:25,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:34:25,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:34:25,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:34:25,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:34:25,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:34:25,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... [2021-03-26 00:34:25,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:34:25,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:34:25,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:34:25,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:34:25,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:34:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 00:34:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:34:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:34:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:34:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:34:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:34:25,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:34:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:34:25,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:34:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:34:25,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:34:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:34:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:34:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:34:25,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:34:25,970 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:34:28,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:34:28,653 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:34:28,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:34:28 BoogieIcfgContainer [2021-03-26 00:34:28,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:34:28,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:34:28,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:34:28,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:34:28,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:34:25" (1/3) ... [2021-03-26 00:34:28,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34059441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:34:28, skipping insertion in model container [2021-03-26 00:34:28,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:25" (2/3) ... [2021-03-26 00:34:28,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34059441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:34:28, skipping insertion in model container [2021-03-26 00:34:28,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:34:28" (3/3) ... [2021-03-26 00:34:28,660 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2021-03-26 00:34:28,666 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:34:28,670 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:34:28,670 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:34:28,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,716 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:28,774 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:34:28,789 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:34:28,806 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:34:28,806 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:34:28,806 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:34:28,807 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:34:28,807 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:34:28,807 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:34:28,807 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:34:28,807 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:34:28,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2021-03-26 00:34:28,877 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:34:28,877 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:28,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:34:28,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2021-03-26 00:34:28,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2021-03-26 00:34:28,889 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:28,899 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2021-03-26 00:34:28,904 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2021-03-26 00:34:28,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2021-03-26 00:34:28,985 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:34:28,986 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:28,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:34:28,990 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:34:36,078 WARN L205 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-26 00:34:36,959 WARN L205 SmtUtils]: Spent 877.00 ms on a formula simplification that was a NOOP. DAG size: 361 [2021-03-26 00:34:40,770 WARN L205 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-26 00:34:44,459 WARN L205 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 528 DAG size of output: 528 [2021-03-26 00:34:47,579 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 00:34:48,047 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 00:34:48,184 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 00:34:56,691 INFO L154 LiptonReduction]: Checked pairs total: 3199 [2021-03-26 00:34:56,692 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-26 00:34:56,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27808 [2021-03-26 00:34:56,715 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:34:56,715 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:56,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:56,716 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:56,716 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1885356956, now seen corresponding path program 1 times [2021-03-26 00:34:56,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:56,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506389856] [2021-03-26 00:34:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:56,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:56,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:56,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:56,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:56,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506389856] [2021-03-26 00:34:56,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:56,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:34:56,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946696502] [2021-03-26 00:34:56,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:34:56,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:56,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:34:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:34:56,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 194 [2021-03-26 00:34:56,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:56,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:56,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 194 [2021-03-26 00:34:56,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:57,116 INFO L129 PetriNetUnfolder]: 49/200 cut-off events. [2021-03-26 00:34:57,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:57,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 200 events. 49/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1032 event pairs, 24 based on Foata normal form. 14/191 useless extension candidates. Maximal degree in co-relation 273. Up to 65 conditions per place. [2021-03-26 00:34:57,120 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-26 00:34:57,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 119 flow [2021-03-26 00:34:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:34:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:34:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2021-03-26 00:34:57,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209621993127147 [2021-03-26 00:34:57,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2021-03-26 00:34:57,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2021-03-26 00:34:57,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:57,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2021-03-26 00:34:57,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:57,159 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-26 00:34:57,160 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-26 00:34:57,162 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 536 transitions. [2021-03-26 00:34:57,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 119 flow [2021-03-26 00:34:57,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 116 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:34:57,166 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2021-03-26 00:34:57,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-26 00:34:57,169 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 00:34:57,169 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:57,169 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:34:57,170 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:34:57,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 90 flow [2021-03-26 00:34:57,175 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 00:34:57,176 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:57,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:34:57,177 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-26 00:34:57,545 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2021-03-26 00:34:57,901 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-03-26 00:34:58,055 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-03-26 00:35:00,592 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-26 00:35:00,716 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 00:35:02,939 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:35:03,344 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:35:03,519 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:35:03,896 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:35:04,084 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:35:04,089 INFO L154 LiptonReduction]: Checked pairs total: 1812 [2021-03-26 00:35:04,089 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 00:35:04,089 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6920 [2021-03-26 00:35:04,091 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 00:35:04,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:04,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:04,091 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] [2021-03-26 00:35:04,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:35:04,092 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 591770321, now seen corresponding path program 1 times [2021-03-26 00:35:04,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:04,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806624369] [2021-03-26 00:35:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:04,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:04,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:04,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:04,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:04,228 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:35:04,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:35:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:04,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806624369] [2021-03-26 00:35:04,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:04,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:04,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734967455] [2021-03-26 00:35:04,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:04,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:04,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:04,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 209 [2021-03-26 00:35:04,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:04,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:04,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 209 [2021-03-26 00:35:04,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:04,315 INFO L129 PetriNetUnfolder]: 41/110 cut-off events. [2021-03-26 00:35:04,316 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:35:04,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 110 events. 41/110 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 413 event pairs, 11 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 184. Up to 40 conditions per place. [2021-03-26 00:35:04,317 INFO L132 encePairwiseOnDemand]: 204/209 looper letters, 7 selfloop transitions, 3 changer transitions 10/38 dead transitions. [2021-03-26 00:35:04,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 126 flow [2021-03-26 00:35:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 921 transitions. [2021-03-26 00:35:04,320 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8813397129186603 [2021-03-26 00:35:04,320 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 921 transitions. [2021-03-26 00:35:04,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 921 transitions. [2021-03-26 00:35:04,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:04,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 921 transitions. [2021-03-26 00:35:04,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.2) internal successors, (921), 5 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:04,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:04,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:04,326 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 921 transitions. [2021-03-26 00:35:04,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 126 flow [2021-03-26 00:35:04,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:04,328 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 77 flow [2021-03-26 00:35:04,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-26 00:35:04,328 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -14 predicate places. [2021-03-26 00:35:04,329 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:04,329 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 77 flow [2021-03-26 00:35:04,329 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 77 flow [2021-03-26 00:35:04,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 77 flow [2021-03-26 00:35:04,334 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 00:35:04,334 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:35:04,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 34 events. 3/34 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:35:04,337 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-26 00:35:05,242 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-26 00:35:05,617 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 00:35:06,319 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-26 00:35:06,672 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 00:35:06,675 INFO L154 LiptonReduction]: Checked pairs total: 792 [2021-03-26 00:35:06,675 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:35:06,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2346 [2021-03-26 00:35:06,676 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 73 flow [2021-03-26 00:35:06,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:06,677 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:06,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:35:06,677 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:06,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:06,678 INFO L82 PathProgramCache]: Analyzing trace with hash 228937056, now seen corresponding path program 1 times [2021-03-26 00:35:06,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:06,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341105573] [2021-03-26 00:35:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:06,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:06,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:06,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341105573] [2021-03-26 00:35:06,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:06,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:35:06,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799677786] [2021-03-26 00:35:06,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:06,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:06,777 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 211 [2021-03-26 00:35:06,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:06,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 211 [2021-03-26 00:35:06,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:06,794 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:35:06,794 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:35:06,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 32 events. 3/32 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-26 00:35:06,795 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-26 00:35:06,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 79 flow [2021-03-26 00:35:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-26 00:35:06,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8878357030015798 [2021-03-26 00:35:06,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-26 00:35:06,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-26 00:35:06,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:06,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-26 00:35:06,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,802 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 73 flow. Second operand 3 states and 562 transitions. [2021-03-26 00:35:06,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 79 flow [2021-03-26 00:35:06,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:06,804 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-03-26 00:35:06,804 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-26 00:35:06,804 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -18 predicate places. [2021-03-26 00:35:06,805 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:06,805 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-26 00:35:06,808 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-26 00:35:06,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-03-26 00:35:06,813 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:35:06,813 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:35:06,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 00:35:06,814 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-26 00:35:06,822 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 00:35:06,822 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:06,823 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 00:35:06,824 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-03-26 00:35:06,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:06,824 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:06,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:35:06,825 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 686251580, now seen corresponding path program 1 times [2021-03-26 00:35:06,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:06,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643231909] [2021-03-26 00:35:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:06,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:06,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:06,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643231909] [2021-03-26 00:35:06,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:06,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:35:06,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589575779] [2021-03-26 00:35:06,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:06,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:06,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:06,907 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 211 [2021-03-26 00:35:06,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:06,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 211 [2021-03-26 00:35:06,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:06,920 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:35:06,920 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 00:35:06,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 32 events. 3/32 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 00:35:06,921 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-26 00:35:06,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 80 flow [2021-03-26 00:35:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-26 00:35:06,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8925750394944708 [2021-03-26 00:35:06,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-26 00:35:06,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-26 00:35:06,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:06,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-26 00:35:06,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,928 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 3 states and 565 transitions. [2021-03-26 00:35:06,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 80 flow [2021-03-26 00:35:06,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:06,930 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 78 flow [2021-03-26 00:35:06,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 00:35:06,930 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2021-03-26 00:35:06,930 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:06,930 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 78 flow [2021-03-26 00:35:06,930 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 78 flow [2021-03-26 00:35:06,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 78 flow [2021-03-26 00:35:06,935 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:35:06,935 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-26 00:35:06,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 32 events. 3/32 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 00:35:06,936 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 00:35:06,948 INFO L154 LiptonReduction]: Checked pairs total: 248 [2021-03-26 00:35:06,949 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:06,949 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 00:35:06,950 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 78 flow [2021-03-26 00:35:06,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:06,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:06,951 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:06,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:35:06,951 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash -279470503, now seen corresponding path program 1 times [2021-03-26 00:35:06,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:06,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396902391] [2021-03-26 00:35:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:06,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:06,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:07,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:07,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396902391] [2021-03-26 00:35:07,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:07,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:07,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048270572] [2021-03-26 00:35:07,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:07,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:07,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-26 00:35:07,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:07,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-26 00:35:07,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:07,054 INFO L129 PetriNetUnfolder]: 10/61 cut-off events. [2021-03-26 00:35:07,055 INFO L130 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2021-03-26 00:35:07,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 61 events. 10/61 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 224 event pairs, 1 based on Foata normal form. 5/64 useless extension candidates. Maximal degree in co-relation 127. Up to 20 conditions per place. [2021-03-26 00:35:07,055 INFO L132 encePairwiseOnDemand]: 206/211 looper letters, 7 selfloop transitions, 4 changer transitions 1/28 dead transitions. [2021-03-26 00:35:07,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 118 flow [2021-03-26 00:35:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:35:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:35:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 717 transitions. [2021-03-26 00:35:07,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8495260663507109 [2021-03-26 00:35:07,058 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 717 transitions. [2021-03-26 00:35:07,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 717 transitions. [2021-03-26 00:35:07,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:07,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 717 transitions. [2021-03-26 00:35:07,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,064 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 78 flow. Second operand 4 states and 717 transitions. [2021-03-26 00:35:07,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 118 flow [2021-03-26 00:35:07,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 107 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 00:35:07,065 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 83 flow [2021-03-26 00:35:07,065 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-26 00:35:07,066 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2021-03-26 00:35:07,066 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:07,066 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 83 flow [2021-03-26 00:35:07,066 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 83 flow [2021-03-26 00:35:07,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 83 flow [2021-03-26 00:35:07,071 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 00:35:07,072 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 00:35:07,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 35 events. 3/35 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2021-03-26 00:35:07,072 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-26 00:35:07,074 INFO L154 LiptonReduction]: Checked pairs total: 229 [2021-03-26 00:35:07,074 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:07,074 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-26 00:35:07,075 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 83 flow [2021-03-26 00:35:07,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:07,076 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:07,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:35:07,076 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -405752413, now seen corresponding path program 2 times [2021-03-26 00:35:07,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:07,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618938331] [2021-03-26 00:35:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:07,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:07,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:07,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:07,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618938331] [2021-03-26 00:35:07,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:07,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:07,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420969088] [2021-03-26 00:35:07,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:07,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:07,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-26 00:35:07,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:07,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-26 00:35:07,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:07,185 INFO L129 PetriNetUnfolder]: 6/66 cut-off events. [2021-03-26 00:35:07,186 INFO L130 PetriNetUnfolder]: For 39/41 co-relation queries the response was YES. [2021-03-26 00:35:07,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 6/66 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 274 event pairs, 2 based on Foata normal form. 5/69 useless extension candidates. Maximal degree in co-relation 127. Up to 15 conditions per place. [2021-03-26 00:35:07,186 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 7 selfloop transitions, 4 changer transitions 2/29 dead transitions. [2021-03-26 00:35:07,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 133 flow [2021-03-26 00:35:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 894 transitions. [2021-03-26 00:35:07,190 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8473933649289099 [2021-03-26 00:35:07,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 894 transitions. [2021-03-26 00:35:07,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 894 transitions. [2021-03-26 00:35:07,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:07,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 894 transitions. [2021-03-26 00:35:07,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,195 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 83 flow. Second operand 5 states and 894 transitions. [2021-03-26 00:35:07,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 133 flow [2021-03-26 00:35:07,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 119 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 00:35:07,198 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 109 flow [2021-03-26 00:35:07,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-26 00:35:07,198 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2021-03-26 00:35:07,198 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:07,198 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 109 flow [2021-03-26 00:35:07,199 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 109 flow [2021-03-26 00:35:07,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 109 flow [2021-03-26 00:35:07,206 INFO L129 PetriNetUnfolder]: 2/39 cut-off events. [2021-03-26 00:35:07,208 INFO L130 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2021-03-26 00:35:07,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 39 events. 2/39 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2021-03-26 00:35:07,209 INFO L142 LiptonReduction]: Number of co-enabled transitions 260 [2021-03-26 00:35:07,218 INFO L154 LiptonReduction]: Checked pairs total: 294 [2021-03-26 00:35:07,218 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:07,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 00:35:07,223 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 109 flow [2021-03-26 00:35:07,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:07,224 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:07,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:35:07,224 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1047970160, now seen corresponding path program 1 times [2021-03-26 00:35:07,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:07,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782768364] [2021-03-26 00:35:07,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:07,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:07,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:35:07,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:35:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:07,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782768364] [2021-03-26 00:35:07,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:07,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:07,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556524804] [2021-03-26 00:35:07,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:07,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:07,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:07,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:07,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-26 00:35:07,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:07,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-26 00:35:07,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:07,452 INFO L129 PetriNetUnfolder]: 4/71 cut-off events. [2021-03-26 00:35:07,453 INFO L130 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2021-03-26 00:35:07,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 71 events. 4/71 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 325 event pairs, 0 based on Foata normal form. 5/75 useless extension candidates. Maximal degree in co-relation 153. Up to 16 conditions per place. [2021-03-26 00:35:07,453 INFO L132 encePairwiseOnDemand]: 206/211 looper letters, 3 selfloop transitions, 7 changer transitions 5/30 dead transitions. [2021-03-26 00:35:07,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 155 flow [2021-03-26 00:35:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:35:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:35:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1072 transitions. [2021-03-26 00:35:07,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8467614533965245 [2021-03-26 00:35:07,458 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1072 transitions. [2021-03-26 00:35:07,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1072 transitions. [2021-03-26 00:35:07,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:07,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1072 transitions. [2021-03-26 00:35:07,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,464 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,464 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 109 flow. Second operand 6 states and 1072 transitions. [2021-03-26 00:35:07,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 155 flow [2021-03-26 00:35:07,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 135 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 00:35:07,468 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 107 flow [2021-03-26 00:35:07,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2021-03-26 00:35:07,468 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2021-03-26 00:35:07,468 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:07,469 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 107 flow [2021-03-26 00:35:07,469 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 107 flow [2021-03-26 00:35:07,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 107 flow [2021-03-26 00:35:07,474 INFO L129 PetriNetUnfolder]: 2/39 cut-off events. [2021-03-26 00:35:07,475 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-03-26 00:35:07,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 39 events. 2/39 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 75. Up to 7 conditions per place. [2021-03-26 00:35:07,475 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-26 00:35:07,518 INFO L154 LiptonReduction]: Checked pairs total: 519 [2021-03-26 00:35:07,518 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:35:07,518 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-26 00:35:07,520 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 105 flow [2021-03-26 00:35:07,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:07,520 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:07,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:35:07,520 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1560634332, now seen corresponding path program 2 times [2021-03-26 00:35:07,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:07,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667256992] [2021-03-26 00:35:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:07,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:35:07,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:35:07,710 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.1 percent of original size [2021-03-26 00:35:07,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 00:35:07,765 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.5 percent of original size [2021-03-26 00:35:07,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 00:35:07,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:07,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:35:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:07,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667256992] [2021-03-26 00:35:07,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:07,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:35:07,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395172242] [2021-03-26 00:35:07,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:35:07,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:35:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:35:07,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 212 [2021-03-26 00:35:07,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:07,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:07,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 212 [2021-03-26 00:35:07,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:08,116 INFO L129 PetriNetUnfolder]: 121/285 cut-off events. [2021-03-26 00:35:08,117 INFO L130 PetriNetUnfolder]: For 269/274 co-relation queries the response was YES. [2021-03-26 00:35:08,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 285 events. 121/285 cut-off events. For 269/274 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1478 event pairs, 30 based on Foata normal form. 17/292 useless extension candidates. Maximal degree in co-relation 619. Up to 148 conditions per place. [2021-03-26 00:35:08,119 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 18 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-26 00:35:08,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 179 flow [2021-03-26 00:35:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2021-03-26 00:35:08,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6188679245283019 [2021-03-26 00:35:08,122 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2021-03-26 00:35:08,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2021-03-26 00:35:08,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:08,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2021-03-26 00:35:08,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:08,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:08,126 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:08,126 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 105 flow. Second operand 5 states and 656 transitions. [2021-03-26 00:35:08,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 179 flow [2021-03-26 00:35:08,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 154 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-26 00:35:08,130 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 125 flow [2021-03-26 00:35:08,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-26 00:35:08,130 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2021-03-26 00:35:08,130 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:08,130 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 125 flow [2021-03-26 00:35:08,131 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 125 flow [2021-03-26 00:35:08,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 125 flow [2021-03-26 00:35:08,148 INFO L129 PetriNetUnfolder]: 46/130 cut-off events. [2021-03-26 00:35:08,148 INFO L130 PetriNetUnfolder]: For 80/85 co-relation queries the response was YES. [2021-03-26 00:35:08,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 130 events. 46/130 cut-off events. For 80/85 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 575 event pairs, 24 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 305. Up to 76 conditions per place. [2021-03-26 00:35:08,150 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-26 00:35:10,263 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2021-03-26 00:35:10,622 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 88 [2021-03-26 00:35:16,612 INFO L154 LiptonReduction]: Checked pairs total: 128 [2021-03-26 00:35:16,612 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:35:16,612 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8482 [2021-03-26 00:35:16,617 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 127 flow [2021-03-26 00:35:16,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:16,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:16,618 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:16,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:35:16,619 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:16,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1530930682, now seen corresponding path program 1 times [2021-03-26 00:35:16,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:16,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753621526] [2021-03-26 00:35:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:16,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:16,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:16,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:16,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:16,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753621526] [2021-03-26 00:35:16,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:16,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:16,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696487011] [2021-03-26 00:35:16,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:16,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:16,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:16,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 213 [2021-03-26 00:35:16,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:16,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:16,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 213 [2021-03-26 00:35:16,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:16,758 INFO L129 PetriNetUnfolder]: 35/111 cut-off events. [2021-03-26 00:35:16,758 INFO L130 PetriNetUnfolder]: For 120/138 co-relation queries the response was YES. [2021-03-26 00:35:16,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 111 events. 35/111 cut-off events. For 120/138 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 469 event pairs, 17 based on Foata normal form. 7/99 useless extension candidates. Maximal degree in co-relation 270. Up to 64 conditions per place. [2021-03-26 00:35:16,759 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2021-03-26 00:35:16,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 27 transitions, 132 flow [2021-03-26 00:35:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-26 00:35:16,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8794992175273866 [2021-03-26 00:35:16,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-26 00:35:16,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-26 00:35:16,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:16,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-26 00:35:16,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:16,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:16,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:16,765 INFO L185 Difference]: Start difference. First operand has 41 places, 28 transitions, 127 flow. Second operand 3 states and 562 transitions. [2021-03-26 00:35:16,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 27 transitions, 132 flow [2021-03-26 00:35:16,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 27 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:35:16,766 INFO L241 Difference]: Finished difference. Result has 42 places, 23 transitions, 99 flow [2021-03-26 00:35:16,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2021-03-26 00:35:16,767 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2021-03-26 00:35:16,767 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:16,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 23 transitions, 99 flow [2021-03-26 00:35:16,767 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 23 transitions, 99 flow [2021-03-26 00:35:16,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 99 flow [2021-03-26 00:35:16,776 INFO L129 PetriNetUnfolder]: 20/63 cut-off events. [2021-03-26 00:35:16,776 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-03-26 00:35:16,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 63 events. 20/63 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 193 event pairs, 11 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 144. Up to 38 conditions per place. [2021-03-26 00:35:16,777 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-26 00:35:18,258 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 363 [2021-03-26 00:35:19,590 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 363 [2021-03-26 00:35:24,858 WARN L205 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 530 DAG size of output: 528 [2021-03-26 00:35:28,154 WARN L205 SmtUtils]: Spent 3.29 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-26 00:35:28,610 INFO L154 LiptonReduction]: Checked pairs total: 96 [2021-03-26 00:35:28,610 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:35:28,610 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11843 [2021-03-26 00:35:28,610 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 100 flow [2021-03-26 00:35:28,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:28,611 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:28,611 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:28,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:35:28,611 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash 28983389, now seen corresponding path program 1 times [2021-03-26 00:35:28,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:28,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273705220] [2021-03-26 00:35:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:28,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:28,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:28,740 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:35:28,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:35:28,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:28,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:28,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273705220] [2021-03-26 00:35:28,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:28,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:28,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065345180] [2021-03-26 00:35:28,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:28,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:28,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 216 [2021-03-26 00:35:28,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:28,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:28,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 216 [2021-03-26 00:35:28,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:28,899 INFO L129 PetriNetUnfolder]: 69/175 cut-off events. [2021-03-26 00:35:28,900 INFO L130 PetriNetUnfolder]: For 108/133 co-relation queries the response was YES. [2021-03-26 00:35:28,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 175 events. 69/175 cut-off events. For 108/133 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 869 event pairs, 31 based on Foata normal form. 19/181 useless extension candidates. Maximal degree in co-relation 421. Up to 92 conditions per place. [2021-03-26 00:35:28,901 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 8 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2021-03-26 00:35:28,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 152 flow [2021-03-26 00:35:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 948 transitions. [2021-03-26 00:35:28,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2021-03-26 00:35:28,908 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 948 transitions. [2021-03-26 00:35:28,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 948 transitions. [2021-03-26 00:35:28,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:28,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 948 transitions. [2021-03-26 00:35:28,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 189.6) internal successors, (948), 5 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:28,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:28,914 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:28,914 INFO L185 Difference]: Start difference. First operand has 39 places, 21 transitions, 100 flow. Second operand 5 states and 948 transitions. [2021-03-26 00:35:28,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 152 flow [2021-03-26 00:35:28,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 128 flow, removed 2 selfloop flow, removed 8 redundant places. [2021-03-26 00:35:28,919 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 136 flow [2021-03-26 00:35:28,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2021-03-26 00:35:28,920 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -14 predicate places. [2021-03-26 00:35:28,920 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:28,920 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 136 flow [2021-03-26 00:35:28,921 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 136 flow [2021-03-26 00:35:28,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 136 flow [2021-03-26 00:35:28,941 INFO L129 PetriNetUnfolder]: 72/182 cut-off events. [2021-03-26 00:35:28,941 INFO L130 PetriNetUnfolder]: For 107/137 co-relation queries the response was YES. [2021-03-26 00:35:28,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 182 events. 72/182 cut-off events. For 107/137 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 902 event pairs, 34 based on Foata normal form. 8/177 useless extension candidates. Maximal degree in co-relation 496. Up to 91 conditions per place. [2021-03-26 00:35:28,943 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-26 00:35:28,948 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:35:28,948 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:35:28,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 00:35:28,949 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 130 flow [2021-03-26 00:35:28,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:28,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:28,949 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:28,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:35:28,949 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1143661977, now seen corresponding path program 1 times [2021-03-26 00:35:28,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:28,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859021659] [2021-03-26 00:35:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:29,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:29,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:29,073 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:35:29,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:35:29,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:29,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859021659] [2021-03-26 00:35:29,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:29,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:35:29,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16362425] [2021-03-26 00:35:29,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:29,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:29,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:29,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 216 [2021-03-26 00:35:29,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 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-26 00:35:29,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:29,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 216 [2021-03-26 00:35:29,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:29,212 INFO L129 PetriNetUnfolder]: 36/113 cut-off events. [2021-03-26 00:35:29,212 INFO L130 PetriNetUnfolder]: For 80/89 co-relation queries the response was YES. [2021-03-26 00:35:29,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 113 events. 36/113 cut-off events. For 80/89 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 10 based on Foata normal form. 19/124 useless extension candidates. Maximal degree in co-relation 369. Up to 64 conditions per place. [2021-03-26 00:35:29,214 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 5 selfloop transitions, 11 changer transitions 3/34 dead transitions. [2021-03-26 00:35:29,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 208 flow [2021-03-26 00:35:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:35:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:35:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1137 transitions. [2021-03-26 00:35:29,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8773148148148148 [2021-03-26 00:35:29,220 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1137 transitions. [2021-03-26 00:35:29,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1137 transitions. [2021-03-26 00:35:29,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:29,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1137 transitions. [2021-03-26 00:35:29,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,229 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,229 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 130 flow. Second operand 6 states and 1137 transitions. [2021-03-26 00:35:29,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 208 flow [2021-03-26 00:35:29,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:29,233 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 194 flow [2021-03-26 00:35:29,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 00:35:29,234 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2021-03-26 00:35:29,234 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:29,234 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 194 flow [2021-03-26 00:35:29,234 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 194 flow [2021-03-26 00:35:29,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 194 flow [2021-03-26 00:35:29,250 INFO L129 PetriNetUnfolder]: 34/110 cut-off events. [2021-03-26 00:35:29,250 INFO L130 PetriNetUnfolder]: For 161/171 co-relation queries the response was YES. [2021-03-26 00:35:29,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 110 events. 34/110 cut-off events. For 161/171 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 438 event pairs, 10 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 381. Up to 61 conditions per place. [2021-03-26 00:35:29,252 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 00:35:29,257 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-26 00:35:29,257 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:35:29,257 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 00:35:29,258 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 186 flow [2021-03-26 00:35:29,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 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-26 00:35:29,259 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:29,259 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:29,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:35:29,259 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash -700644724, now seen corresponding path program 1 times [2021-03-26 00:35:29,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:29,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820149675] [2021-03-26 00:35:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:29,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:29,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:29,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:29,450 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:35:29,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:35:29,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:29,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:29,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820149675] [2021-03-26 00:35:29,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:29,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:35:29,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273905805] [2021-03-26 00:35:29,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:35:29,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:35:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:35:29,476 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 216 [2021-03-26 00:35:29,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:29,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 216 [2021-03-26 00:35:29,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:29,602 INFO L129 PetriNetUnfolder]: 21/70 cut-off events. [2021-03-26 00:35:29,603 INFO L130 PetriNetUnfolder]: For 122/130 co-relation queries the response was YES. [2021-03-26 00:35:29,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 70 events. 21/70 cut-off events. For 122/130 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 221 event pairs, 6 based on Foata normal form. 9/72 useless extension candidates. Maximal degree in co-relation 257. Up to 36 conditions per place. [2021-03-26 00:35:29,604 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 2 selfloop transitions, 11 changer transitions 3/31 dead transitions. [2021-03-26 00:35:29,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 218 flow [2021-03-26 00:35:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:35:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:35:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1320 transitions. [2021-03-26 00:35:29,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2021-03-26 00:35:29,609 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1320 transitions. [2021-03-26 00:35:29,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1320 transitions. [2021-03-26 00:35:29,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:29,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1320 transitions. [2021-03-26 00:35:29,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,617 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:29,617 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 186 flow. Second operand 7 states and 1320 transitions. [2021-03-26 00:35:29,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 218 flow [2021-03-26 00:35:29,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 192 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 00:35:29,619 INFO L241 Difference]: Finished difference. Result has 45 places, 28 transitions, 172 flow [2021-03-26 00:35:29,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2021-03-26 00:35:29,620 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2021-03-26 00:35:29,620 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:29,620 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 28 transitions, 172 flow [2021-03-26 00:35:29,620 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 28 transitions, 172 flow [2021-03-26 00:35:29,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 172 flow [2021-03-26 00:35:29,630 INFO L129 PetriNetUnfolder]: 19/67 cut-off events. [2021-03-26 00:35:29,630 INFO L130 PetriNetUnfolder]: For 85/87 co-relation queries the response was YES. [2021-03-26 00:35:29,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 67 events. 19/67 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 213 event pairs, 6 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 216. Up to 22 conditions per place. [2021-03-26 00:35:29,631 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-26 00:35:29,815 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 00:35:30,008 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 00:35:30,330 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:35:30,673 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:35:31,036 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-26 00:35:31,384 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-26 00:35:32,029 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2021-03-26 00:35:32,637 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2021-03-26 00:35:32,640 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 00:35:32,640 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:35:32,641 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3021 [2021-03-26 00:35:32,645 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 158 flow [2021-03-26 00:35:32,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:32,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:32,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:32,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:35:32,646 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:32,646 INFO L82 PathProgramCache]: Analyzing trace with hash -496065818, now seen corresponding path program 1 times [2021-03-26 00:35:32,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:32,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139817428] [2021-03-26 00:35:32,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:35:32,768 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:35:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:35:32,881 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:35:32,947 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:35:32,947 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:35:32,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:35:33,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:35:33 BasicIcfg [2021-03-26 00:35:33,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:35:33,078 INFO L168 Benchmark]: Toolchain (without parser) took 67825.32 ms. Allocated memory was 255.9 MB in the beginning and 767.6 MB in the end (delta: 511.7 MB). Free memory was 233.2 MB in the beginning and 306.8 MB in the end (delta: -73.6 MB). Peak memory consumption was 437.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:35:33,078 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:35:33,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.81 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 233.2 MB in the beginning and 327.0 MB in the end (delta: -93.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:35:33,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.67 ms. Allocated memory is still 369.1 MB. Free memory was 327.0 MB in the beginning and 324.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:35:33,081 INFO L168 Benchmark]: Boogie Preprocessor took 52.19 ms. Allocated memory is still 369.1 MB. Free memory was 324.4 MB in the beginning and 321.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:35:33,081 INFO L168 Benchmark]: RCFGBuilder took 2774.22 ms. Allocated memory was 369.1 MB in the beginning and 444.6 MB in the end (delta: 75.5 MB). Free memory was 321.4 MB in the beginning and 326.7 MB in the end (delta: -5.3 MB). Peak memory consumption was 85.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:35:33,082 INFO L168 Benchmark]: TraceAbstraction took 64421.05 ms. Allocated memory was 444.6 MB in the beginning and 767.6 MB in the end (delta: 323.0 MB). Free memory was 325.7 MB in the beginning and 306.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 341.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:35:33,090 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.16 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 512.81 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 233.2 MB in the beginning and 327.0 MB in the end (delta: -93.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 56.67 ms. Allocated memory is still 369.1 MB. Free memory was 327.0 MB in the beginning and 324.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 52.19 ms. Allocated memory is still 369.1 MB. Free memory was 324.4 MB in the beginning and 321.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2774.22 ms. Allocated memory was 369.1 MB in the beginning and 444.6 MB in the end (delta: 75.5 MB). Free memory was 321.4 MB in the beginning and 326.7 MB in the end (delta: -5.3 MB). Peak memory consumption was 85.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 64421.05 ms. Allocated memory was 444.6 MB in the beginning and 767.6 MB in the end (delta: 323.0 MB). Free memory was 325.7 MB in the beginning and 306.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 341.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27787.9ms, 121 PlacesBefore, 52 PlacesAfterwards, 113 TransitionsBefore, 43 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 41 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 3199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1294, positive: 1204, positive conditional: 1204, positive unconditional: 0, negative: 90, negative conditional: 90, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1037, positive: 1001, positive conditional: 0, positive unconditional: 1001, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1037, positive: 1001, positive conditional: 0, positive unconditional: 1001, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1037, positive: 997, positive conditional: 0, positive unconditional: 997, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12990, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 367, negative conditional: 0, negative unconditional: 367, unknown: 12613, unknown conditional: 0, unknown unconditional: 12613] ], Cache Queries: [ total: 1294, positive: 203, positive conditional: 203, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 1037, unknown conditional: 1037, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 42, Positive conditional cache size: 42, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6918.7ms, 49 PlacesBefore, 34 PlacesAfterwards, 40 TransitionsBefore, 25 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 1812 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 373, positive: 256, positive conditional: 256, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, positive: 86, positive conditional: 21, positive unconditional: 65, negative: 27, negative conditional: 3, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, positive: 86, positive conditional: 21, positive unconditional: 65, negative: 27, negative conditional: 3, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 25, negative conditional: 3, negative unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3229, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 617, negative conditional: 66, negative unconditional: 551, unknown: 2597, unknown conditional: 0, unknown unconditional: 2597] ], Cache Queries: [ total: 373, positive: 170, positive conditional: 170, positive unconditional: 0, negative: 90, negative conditional: 90, negative unconditional: 0, unknown: 113, unknown conditional: 113, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 65, Positive conditional cache size: 65, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2345.9ms, 38 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 106, positive conditional: 106, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 69, Positive conditional cache size: 69, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 1, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 1, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.1ms, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 248 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 4, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9ms, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, 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: 39, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9ms, 41 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 294 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.3ms, 41 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 519 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 9, 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: 10, positive: 10, positive conditional: 9, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 82, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 50, Positive conditional cache size: 50, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8481.3ms, 41 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 10, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 10, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7834, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7814, unknown conditional: 0, unknown unconditional: 7814] ], Cache Queries: [ total: 25, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11842.5ms, 42 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 13, 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: 14, positive: 14, positive conditional: 13, 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: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, positive: 188, positive conditional: 188, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 24, Positive conditional cache size: 24, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 9, 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: 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 16, Positive conditional cache size: 16, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.9ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 16, Positive conditional cache size: 16, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3020.2ms, 45 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, 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: 5, positive: 5, positive conditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={8: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] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={8: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] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L795] EXPR 2 !x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))) [L795] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L796] EXPR 2 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))) [L796] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L797] EXPR 2 !x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))) [L797] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L797] 2 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_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] EXPR 2 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L798] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 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_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] EXPR 2 !x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L799] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] EXPR 2 !x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L800] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={8:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={8: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] [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={8:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={8: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] [L825] 3 __unbuffered_p2_EAX = y [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={8:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={8: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] [L831] 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) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 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 [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L835] 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 [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] 1 y = 2 [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 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 [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 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 [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={8:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, 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, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 64145.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1337.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27899.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 25 SDslu, 23 SDs, 0 SdLazy, 212 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 370.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 365.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=11, InterpolantAutomatonStates: 55, 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: 60.3ms SsaConstructionTime, 694.9ms SatisfiabilityAnalysisTime, 952.4ms InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...