/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 21:51:32,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 21:51:32,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 21:51:32,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 21:51:32,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 21:51:32,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 21:51:32,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 21:51:32,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 21:51:32,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 21:51:32,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 21:51:32,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 21:51:32,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 21:51:32,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 21:51:32,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 21:51:32,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 21:51:32,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 21:51:32,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 21:51:32,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 21:51:32,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 21:51:32,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 21:51:32,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 21:51:32,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 21:51:32,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 21:51:32,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 21:51:32,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 21:51:32,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 21:51:32,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 21:51:32,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 21:51:32,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 21:51:32,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 21:51:32,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 21:51:32,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 21:51:32,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 21:51:32,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 21:51:32,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 21:51:32,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 21:51:32,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 21:51:32,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 21:51:32,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 21:51:32,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 21:51:32,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 21:51:32,518 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-NoLbe.epf [2022-01-18 21:51:32,546 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 21:51:32,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 21:51:32,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 21:51:32,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 21:51:32,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 21:51:32,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 21:51:32,548 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 21:51:32,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 21:51:32,548 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 21:51:32,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 21:51:32,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 21:51:32,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 21:51:32,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 21:51:32,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 21:51:32,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 21:51:32,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 21:51:32,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 21:51:32,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 21:51:32,552 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 21:51:32,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-18 21:51:32,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 21:51:32,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 21:51:32,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 21:51:32,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 21:51:32,761 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 21:51:32,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2022-01-18 21:51:32,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4e8a3c0/a13316d51e0d423c8cfa39e474153236/FLAG61b9f933f [2022-01-18 21:51:33,209 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 21:51:33,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-01-18 21:51:33,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4e8a3c0/a13316d51e0d423c8cfa39e474153236/FLAG61b9f933f [2022-01-18 21:51:33,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4e8a3c0/a13316d51e0d423c8cfa39e474153236 [2022-01-18 21:51:33,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 21:51:33,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 21:51:33,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 21:51:33,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 21:51:33,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 21:51:33,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:51:33" (1/1) ... [2022-01-18 21:51:33,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50468396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:33, skipping insertion in model container [2022-01-18 21:51:33,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:51:33" (1/1) ... [2022-01-18 21:51:33,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 21:51:33,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 21:51:33,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2022-01-18 21:51:33,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2022-01-18 21:51:33,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2022-01-18 21:51:33,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 21:51:33,996 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 21:51:34,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2022-01-18 21:51:34,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2022-01-18 21:51:34,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2022-01-18 21:51:34,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 21:51:34,076 INFO L208 MainTranslator]: Completed translation [2022-01-18 21:51:34,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34 WrapperNode [2022-01-18 21:51:34,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 21:51:34,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 21:51:34,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 21:51:34,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 21:51:34,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,128 INFO L137 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-01-18 21:51:34,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 21:51:34,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 21:51:34,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 21:51:34,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 21:51:34,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 21:51:34,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 21:51:34,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 21:51:34,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 21:51:34,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (1/1) ... [2022-01-18 21:51:34,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 21:51:34,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 21:51:34,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 21:51:34,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 21:51:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-18 21:51:34,225 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-18 21:51:34,226 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-18 21:51:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 21:51:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 21:51:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 21:51:34,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 21:51:34,228 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 21:51:34,342 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 21:51:34,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 21:51:34,656 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 21:51:34,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 21:51:34,665 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-18 21:51:34,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:51:34 BoogieIcfgContainer [2022-01-18 21:51:34,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 21:51:34,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 21:51:34,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 21:51:34,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 21:51:34,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 09:51:33" (1/3) ... [2022-01-18 21:51:34,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629df0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:51:34, skipping insertion in model container [2022-01-18 21:51:34,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:51:34" (2/3) ... [2022-01-18 21:51:34,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629df0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:51:34, skipping insertion in model container [2022-01-18 21:51:34,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:51:34" (3/3) ... [2022-01-18 21:51:34,675 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-01-18 21:51:34,681 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 21:51:34,681 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-18 21:51:34,681 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 21:51:34,752 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,752 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,752 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,753 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,753 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,753 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,753 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,754 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,754 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,754 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,754 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,754 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,755 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,755 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,755 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,756 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,759 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,760 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,761 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,762 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,763 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,764 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,765 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,766 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,767 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,770 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,808 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,812 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,816 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,816 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,816 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,824 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,825 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,825 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,825 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,825 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,826 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,827 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,827 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,827 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,827 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,828 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,828 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,828 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,828 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,828 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,828 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,829 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,830 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,830 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,831 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,832 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,833 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,834 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,835 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,836 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,849 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,849 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,850 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,852 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,853 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,853 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,853 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,853 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,854 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,854 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,855 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,855 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,856 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,856 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,856 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,857 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,858 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,858 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,858 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,858 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,858 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,858 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,859 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,859 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,859 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,859 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,868 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,869 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,870 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,871 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,872 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,873 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,874 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,875 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,876 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,876 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,876 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,876 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,877 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,877 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,877 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,878 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,878 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,878 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,879 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,880 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,881 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,882 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,883 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,883 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,883 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,883 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,883 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,883 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,884 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,885 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 21:51:34,910 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-18 21:51:34,947 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 21:51:34,952 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 21:51:34,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-18 21:51:34,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 266 places, 274 transitions, 564 flow [2022-01-18 21:51:35,041 INFO L129 PetriNetUnfolder]: 15/272 cut-off events. [2022-01-18 21:51:35,041 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-18 21:51:35,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 272 events. 15/272 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2022-01-18 21:51:35,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 274 transitions, 564 flow [2022-01-18 21:51:35,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 262 transitions, 533 flow [2022-01-18 21:51:35,067 INFO L129 PetriNetUnfolder]: 2/66 cut-off events. [2022-01-18 21:51:35,068 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 21:51:35,068 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:35,068 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:35,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -266547570, now seen corresponding path program 1 times [2022-01-18 21:51:35,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299776349] [2022-01-18 21:51:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:35,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:35,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:35,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299776349] [2022-01-18 21:51:35,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299776349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:35,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:35,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 21:51:35,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759870028] [2022-01-18 21:51:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:35,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 21:51:35,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 21:51:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 21:51:35,321 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 274 [2022-01-18 21:51:35,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 262 transitions, 533 flow. Second operand has 2 states, 2 states have (on average 261.5) internal successors, (523), 2 states have internal predecessors, (523), 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) [2022-01-18 21:51:35,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:35,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 274 [2022-01-18 21:51:35,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:35,402 INFO L129 PetriNetUnfolder]: 10/251 cut-off events. [2022-01-18 21:51:35,402 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-01-18 21:51:35,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 251 events. 10/251 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 283 event pairs, 0 based on Foata normal form. 7/246 useless extension candidates. Maximal degree in co-relation 191. Up to 4 conditions per place. [2022-01-18 21:51:35,408 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 3 selfloop transitions, 0 changer transitions 0/251 dead transitions. [2022-01-18 21:51:35,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 251 transitions, 517 flow [2022-01-18 21:51:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 21:51:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-18 21:51:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 530 transitions. [2022-01-18 21:51:35,426 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9671532846715328 [2022-01-18 21:51:35,426 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 530 transitions. [2022-01-18 21:51:35,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 530 transitions. [2022-01-18 21:51:35,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:35,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 530 transitions. [2022-01-18 21:51:35,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 265.0) internal successors, (530), 2 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:51:35,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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) [2022-01-18 21:51:35,455 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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) [2022-01-18 21:51:35,456 INFO L186 Difference]: Start difference. First operand has 254 places, 262 transitions, 533 flow. Second operand 2 states and 530 transitions. [2022-01-18 21:51:35,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 251 transitions, 517 flow [2022-01-18 21:51:35,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 512 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 21:51:35,467 INFO L242 Difference]: Finished difference. Result has 246 places, 251 transitions, 506 flow [2022-01-18 21:51:35,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=506, PETRI_PLACES=246, PETRI_TRANSITIONS=251} [2022-01-18 21:51:35,472 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-18 21:51:35,472 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 251 transitions, 506 flow [2022-01-18 21:51:35,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 261.5) internal successors, (523), 2 states have internal predecessors, (523), 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) [2022-01-18 21:51:35,473 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:35,474 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:35,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 21:51:35,474 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1627698218, now seen corresponding path program 1 times [2022-01-18 21:51:35,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895586050] [2022-01-18 21:51:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:35,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:35,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:35,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895586050] [2022-01-18 21:51:35,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895586050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:35,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:35,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 21:51:35,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58892901] [2022-01-18 21:51:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:35,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 21:51:35,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 21:51:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-18 21:51:35,815 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 274 [2022-01-18 21:51:35,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 251 transitions, 506 flow. Second operand has 12 states, 12 states have (on average 199.75) internal successors, (2397), 12 states have internal predecessors, (2397), 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) [2022-01-18 21:51:35,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:35,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 274 [2022-01-18 21:51:35,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:36,726 INFO L129 PetriNetUnfolder]: 1003/4117 cut-off events. [2022-01-18 21:51:36,726 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-18 21:51:36,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5628 conditions, 4117 events. 1003/4117 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 33933 event pairs, 789 based on Foata normal form. 0/3831 useless extension candidates. Maximal degree in co-relation 5625. Up to 1435 conditions per place. [2022-01-18 21:51:36,757 INFO L132 encePairwiseOnDemand]: 261/274 looper letters, 52 selfloop transitions, 12 changer transitions 0/247 dead transitions. [2022-01-18 21:51:36,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 247 transitions, 626 flow [2022-01-18 21:51:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 21:51:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 21:51:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2626 transitions. [2022-01-18 21:51:36,763 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7372262773722628 [2022-01-18 21:51:36,763 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2626 transitions. [2022-01-18 21:51:36,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2626 transitions. [2022-01-18 21:51:36,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:36,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2626 transitions. [2022-01-18 21:51:36,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 202.0) internal successors, (2626), 13 states have internal predecessors, (2626), 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) [2022-01-18 21:51:36,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 274.0) internal successors, (3836), 14 states have internal predecessors, (3836), 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) [2022-01-18 21:51:36,777 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 274.0) internal successors, (3836), 14 states have internal predecessors, (3836), 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) [2022-01-18 21:51:36,777 INFO L186 Difference]: Start difference. First operand has 246 places, 251 transitions, 506 flow. Second operand 13 states and 2626 transitions. [2022-01-18 21:51:36,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 247 transitions, 626 flow [2022-01-18 21:51:36,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 247 transitions, 626 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-18 21:51:36,783 INFO L242 Difference]: Finished difference. Result has 255 places, 247 transitions, 522 flow [2022-01-18 21:51:36,783 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=522, PETRI_PLACES=255, PETRI_TRANSITIONS=247} [2022-01-18 21:51:36,784 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1 predicate places. [2022-01-18 21:51:36,784 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 247 transitions, 522 flow [2022-01-18 21:51:36,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 199.75) internal successors, (2397), 12 states have internal predecessors, (2397), 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) [2022-01-18 21:51:36,785 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:36,786 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:36,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 21:51:36,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2013468752, now seen corresponding path program 1 times [2022-01-18 21:51:36,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:36,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779221624] [2022-01-18 21:51:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:36,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:36,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:36,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779221624] [2022-01-18 21:51:36,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779221624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:36,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:36,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 21:51:36,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888847696] [2022-01-18 21:51:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:36,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 21:51:36,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 21:51:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 21:51:36,886 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 274 [2022-01-18 21:51:36,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 247 transitions, 522 flow. Second operand has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 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) [2022-01-18 21:51:36,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:36,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 274 [2022-01-18 21:51:36,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:36,978 INFO L129 PetriNetUnfolder]: 26/432 cut-off events. [2022-01-18 21:51:36,978 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-18 21:51:36,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 432 events. 26/432 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1078 event pairs, 2 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 495. Up to 13 conditions per place. [2022-01-18 21:51:36,981 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 9 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2022-01-18 21:51:36,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 247 transitions, 554 flow [2022-01-18 21:51:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-18 21:51:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-18 21:51:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1015 transitions. [2022-01-18 21:51:36,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.926094890510949 [2022-01-18 21:51:36,985 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1015 transitions. [2022-01-18 21:51:36,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1015 transitions. [2022-01-18 21:51:36,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:36,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1015 transitions. [2022-01-18 21:51:36,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 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) [2022-01-18 21:51:36,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2022-01-18 21:51:36,990 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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) [2022-01-18 21:51:36,990 INFO L186 Difference]: Start difference. First operand has 255 places, 247 transitions, 522 flow. Second operand 4 states and 1015 transitions. [2022-01-18 21:51:36,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 247 transitions, 554 flow [2022-01-18 21:51:36,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 247 transitions, 531 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-01-18 21:51:36,995 INFO L242 Difference]: Finished difference. Result has 246 places, 245 transitions, 505 flow [2022-01-18 21:51:36,996 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=246, PETRI_TRANSITIONS=245} [2022-01-18 21:51:36,998 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-18 21:51:36,998 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 245 transitions, 505 flow [2022-01-18 21:51:36,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 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) [2022-01-18 21:51:36,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:36,999 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:36,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 21:51:36,999 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1617079602, now seen corresponding path program 1 times [2022-01-18 21:51:37,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:37,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813435470] [2022-01-18 21:51:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:37,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:37,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:37,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813435470] [2022-01-18 21:51:37,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813435470] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:37,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:37,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 21:51:37,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875001733] [2022-01-18 21:51:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:37,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 21:51:37,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 21:51:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 21:51:37,107 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 274 [2022-01-18 21:51:37,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 245 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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) [2022-01-18 21:51:37,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:37,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 274 [2022-01-18 21:51:37,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:37,183 INFO L129 PetriNetUnfolder]: 33/527 cut-off events. [2022-01-18 21:51:37,183 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-01-18 21:51:37,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 527 events. 33/527 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1259 event pairs, 2 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 582. Up to 23 conditions per place. [2022-01-18 21:51:37,187 INFO L132 encePairwiseOnDemand]: 270/274 looper letters, 10 selfloop transitions, 3 changer transitions 0/249 dead transitions. [2022-01-18 21:51:37,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 249 transitions, 542 flow [2022-01-18 21:51:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 21:51:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 21:51:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2022-01-18 21:51:37,189 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9476885644768857 [2022-01-18 21:51:37,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2022-01-18 21:51:37,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2022-01-18 21:51:37,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:37,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2022-01-18 21:51:37,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 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) [2022-01-18 21:51:37,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2022-01-18 21:51:37,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2022-01-18 21:51:37,194 INFO L186 Difference]: Start difference. First operand has 246 places, 245 transitions, 505 flow. Second operand 3 states and 779 transitions. [2022-01-18 21:51:37,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 249 transitions, 542 flow [2022-01-18 21:51:37,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 249 transitions, 532 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 21:51:37,199 INFO L242 Difference]: Finished difference. Result has 246 places, 246 transitions, 510 flow [2022-01-18 21:51:37,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=246, PETRI_TRANSITIONS=246} [2022-01-18 21:51:37,201 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-18 21:51:37,201 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 246 transitions, 510 flow [2022-01-18 21:51:37,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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) [2022-01-18 21:51:37,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:37,202 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:37,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 21:51:37,202 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:37,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash 771775214, now seen corresponding path program 1 times [2022-01-18 21:51:37,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:37,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582710367] [2022-01-18 21:51:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:37,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:37,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582710367] [2022-01-18 21:51:37,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582710367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:37,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:37,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-18 21:51:37,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328755933] [2022-01-18 21:51:37,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:37,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-18 21:51:37,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-18 21:51:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-18 21:51:37,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 274 [2022-01-18 21:51:37,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 246 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 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) [2022-01-18 21:51:37,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:37,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 274 [2022-01-18 21:51:37,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:37,412 INFO L129 PetriNetUnfolder]: 51/836 cut-off events. [2022-01-18 21:51:37,412 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-18 21:51:37,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 836 events. 51/836 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2997 event pairs, 7 based on Foata normal form. 0/788 useless extension candidates. Maximal degree in co-relation 940. Up to 27 conditions per place. [2022-01-18 21:51:37,418 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 15 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-01-18 21:51:37,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 573 flow [2022-01-18 21:51:37,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-18 21:51:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-18 21:51:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1281 transitions. [2022-01-18 21:51:37,422 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935036496350365 [2022-01-18 21:51:37,422 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1281 transitions. [2022-01-18 21:51:37,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1281 transitions. [2022-01-18 21:51:37,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:37,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1281 transitions. [2022-01-18 21:51:37,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 256.2) internal successors, (1281), 5 states have internal predecessors, (1281), 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) [2022-01-18 21:51:37,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2022-01-18 21:51:37,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2022-01-18 21:51:37,428 INFO L186 Difference]: Start difference. First operand has 246 places, 246 transitions, 510 flow. Second operand 5 states and 1281 transitions. [2022-01-18 21:51:37,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 573 flow [2022-01-18 21:51:37,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 254 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 21:51:37,433 INFO L242 Difference]: Finished difference. Result has 252 places, 249 transitions, 537 flow [2022-01-18 21:51:37,434 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=252, PETRI_TRANSITIONS=249} [2022-01-18 21:51:37,436 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -2 predicate places. [2022-01-18 21:51:37,436 INFO L470 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 537 flow [2022-01-18 21:51:37,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 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) [2022-01-18 21:51:37,437 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:37,437 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:37,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 21:51:37,438 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash -703749757, now seen corresponding path program 1 times [2022-01-18 21:51:37,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:37,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172080935] [2022-01-18 21:51:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:37,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:37,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:37,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172080935] [2022-01-18 21:51:37,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172080935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:37,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:37,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-18 21:51:37,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690536379] [2022-01-18 21:51:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:37,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-18 21:51:37,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-18 21:51:37,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-01-18 21:51:37,892 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 274 [2022-01-18 21:51:37,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 249 transitions, 537 flow. Second operand has 17 states, 17 states have (on average 187.41176470588235) internal successors, (3186), 17 states have internal predecessors, (3186), 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) [2022-01-18 21:51:37,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:37,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 274 [2022-01-18 21:51:37,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:39,483 INFO L129 PetriNetUnfolder]: 1599/6669 cut-off events. [2022-01-18 21:51:39,483 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-01-18 21:51:39,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9623 conditions, 6669 events. 1599/6669 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 58289 event pairs, 1290 based on Foata normal form. 0/6318 useless extension candidates. Maximal degree in co-relation 9616. Up to 2556 conditions per place. [2022-01-18 21:51:39,525 INFO L132 encePairwiseOnDemand]: 258/274 looper letters, 79 selfloop transitions, 20 changer transitions 0/271 dead transitions. [2022-01-18 21:51:39,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 271 transitions, 781 flow [2022-01-18 21:51:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 21:51:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-18 21:51:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2876 transitions. [2022-01-18 21:51:39,533 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6997566909975669 [2022-01-18 21:51:39,533 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2876 transitions. [2022-01-18 21:51:39,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2876 transitions. [2022-01-18 21:51:39,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:39,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2876 transitions. [2022-01-18 21:51:39,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 191.73333333333332) internal successors, (2876), 15 states have internal predecessors, (2876), 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) [2022-01-18 21:51:39,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 274.0) internal successors, (4384), 16 states have internal predecessors, (4384), 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) [2022-01-18 21:51:39,546 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 274.0) internal successors, (4384), 16 states have internal predecessors, (4384), 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) [2022-01-18 21:51:39,546 INFO L186 Difference]: Start difference. First operand has 252 places, 249 transitions, 537 flow. Second operand 15 states and 2876 transitions. [2022-01-18 21:51:39,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 271 transitions, 781 flow [2022-01-18 21:51:39,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 271 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-18 21:51:39,554 INFO L242 Difference]: Finished difference. Result has 272 places, 262 transitions, 644 flow [2022-01-18 21:51:39,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=644, PETRI_PLACES=272, PETRI_TRANSITIONS=262} [2022-01-18 21:51:39,556 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 18 predicate places. [2022-01-18 21:51:39,556 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 262 transitions, 644 flow [2022-01-18 21:51:39,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 187.41176470588235) internal successors, (3186), 17 states have internal predecessors, (3186), 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) [2022-01-18 21:51:39,557 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:39,557 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:39,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 21:51:39,558 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -940168002, now seen corresponding path program 1 times [2022-01-18 21:51:39,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:39,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125665404] [2022-01-18 21:51:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:39,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:40,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125665404] [2022-01-18 21:51:40,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125665404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:40,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:40,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 21:51:40,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467511112] [2022-01-18 21:51:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:40,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 21:51:40,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 21:51:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-01-18 21:51:40,623 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 274 [2022-01-18 21:51:40,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 262 transitions, 644 flow. Second operand has 27 states, 27 states have (on average 173.92592592592592) internal successors, (4696), 27 states have internal predecessors, (4696), 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) [2022-01-18 21:51:40,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:40,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 274 [2022-01-18 21:51:40,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:43,713 INFO L129 PetriNetUnfolder]: 1457/6029 cut-off events. [2022-01-18 21:51:43,714 INFO L130 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-01-18 21:51:43,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 6029 events. 1457/6029 cut-off events. For 117/120 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 51269 event pairs, 1160 based on Foata normal form. 2/5754 useless extension candidates. Maximal degree in co-relation 8852. Up to 2311 conditions per place. [2022-01-18 21:51:43,755 INFO L132 encePairwiseOnDemand]: 243/274 looper letters, 88 selfloop transitions, 45 changer transitions 0/297 dead transitions. [2022-01-18 21:51:43,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 1004 flow [2022-01-18 21:51:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-18 21:51:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-18 21:51:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4778 transitions. [2022-01-18 21:51:43,765 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6458502297918356 [2022-01-18 21:51:43,766 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4778 transitions. [2022-01-18 21:51:43,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4778 transitions. [2022-01-18 21:51:43,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:43,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4778 transitions. [2022-01-18 21:51:43,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 176.96296296296296) internal successors, (4778), 27 states have internal predecessors, (4778), 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) [2022-01-18 21:51:43,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 274.0) internal successors, (7672), 28 states have internal predecessors, (7672), 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) [2022-01-18 21:51:43,801 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 274.0) internal successors, (7672), 28 states have internal predecessors, (7672), 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) [2022-01-18 21:51:43,801 INFO L186 Difference]: Start difference. First operand has 272 places, 262 transitions, 644 flow. Second operand 27 states and 4778 transitions. [2022-01-18 21:51:43,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 1004 flow [2022-01-18 21:51:43,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 297 transitions, 991 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-18 21:51:43,880 INFO L242 Difference]: Finished difference. Result has 303 places, 284 transitions, 870 flow [2022-01-18 21:51:43,881 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=870, PETRI_PLACES=303, PETRI_TRANSITIONS=284} [2022-01-18 21:51:43,881 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 49 predicate places. [2022-01-18 21:51:43,881 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 284 transitions, 870 flow [2022-01-18 21:51:43,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 173.92592592592592) internal successors, (4696), 27 states have internal predecessors, (4696), 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) [2022-01-18 21:51:43,882 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:43,882 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:43,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 21:51:43,883 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1623156073, now seen corresponding path program 1 times [2022-01-18 21:51:43,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:43,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670200924] [2022-01-18 21:51:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:43,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:44,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:44,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670200924] [2022-01-18 21:51:44,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670200924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:44,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:44,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 21:51:44,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692444777] [2022-01-18 21:51:44,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:44,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 21:51:44,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 21:51:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-18 21:51:44,615 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-18 21:51:44,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 284 transitions, 870 flow. Second operand has 18 states, 18 states have (on average 176.83333333333334) internal successors, (3183), 18 states have internal predecessors, (3183), 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) [2022-01-18 21:51:44,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:44,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-18 21:51:44,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:46,433 INFO L129 PetriNetUnfolder]: 1619/6777 cut-off events. [2022-01-18 21:51:46,434 INFO L130 PetriNetUnfolder]: For 451/455 co-relation queries the response was YES. [2022-01-18 21:51:46,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10294 conditions, 6777 events. 1619/6777 cut-off events. For 451/455 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 59147 event pairs, 734 based on Foata normal form. 3/6433 useless extension candidates. Maximal degree in co-relation 10268. Up to 2470 conditions per place. [2022-01-18 21:51:46,475 INFO L132 encePairwiseOnDemand]: 253/274 looper letters, 117 selfloop transitions, 34 changer transitions 0/320 dead transitions. [2022-01-18 21:51:46,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 1284 flow [2022-01-18 21:51:46,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 21:51:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 21:51:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2913 transitions. [2022-01-18 21:51:46,484 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6644616788321168 [2022-01-18 21:51:46,484 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2913 transitions. [2022-01-18 21:51:46,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2913 transitions. [2022-01-18 21:51:46,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:46,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2913 transitions. [2022-01-18 21:51:46,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 182.0625) internal successors, (2913), 16 states have internal predecessors, (2913), 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) [2022-01-18 21:51:46,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 274.0) internal successors, (4658), 17 states have internal predecessors, (4658), 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) [2022-01-18 21:51:46,498 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 274.0) internal successors, (4658), 17 states have internal predecessors, (4658), 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) [2022-01-18 21:51:46,498 INFO L186 Difference]: Start difference. First operand has 303 places, 284 transitions, 870 flow. Second operand 16 states and 2913 transitions. [2022-01-18 21:51:46,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 1284 flow [2022-01-18 21:51:46,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 320 transitions, 1241 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-01-18 21:51:46,507 INFO L242 Difference]: Finished difference. Result has 311 places, 294 transitions, 994 flow [2022-01-18 21:51:46,508 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=994, PETRI_PLACES=311, PETRI_TRANSITIONS=294} [2022-01-18 21:51:46,508 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 57 predicate places. [2022-01-18 21:51:46,508 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 294 transitions, 994 flow [2022-01-18 21:51:46,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 176.83333333333334) internal successors, (3183), 18 states have internal predecessors, (3183), 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) [2022-01-18 21:51:46,509 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:46,510 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:46,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 21:51:46,510 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash -156557425, now seen corresponding path program 2 times [2022-01-18 21:51:46,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:46,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182813529] [2022-01-18 21:51:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:46,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:47,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182813529] [2022-01-18 21:51:47,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182813529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:47,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:47,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 21:51:47,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993217461] [2022-01-18 21:51:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:47,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 21:51:47,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 21:51:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-01-18 21:51:47,073 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-18 21:51:47,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 294 transitions, 994 flow. Second operand has 18 states, 18 states have (on average 176.83333333333334) internal successors, (3183), 18 states have internal predecessors, (3183), 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) [2022-01-18 21:51:47,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:47,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-18 21:51:47,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:49,095 INFO L129 PetriNetUnfolder]: 1640/6855 cut-off events. [2022-01-18 21:51:49,096 INFO L130 PetriNetUnfolder]: For 708/712 co-relation queries the response was YES. [2022-01-18 21:51:49,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10633 conditions, 6855 events. 1640/6855 cut-off events. For 708/712 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 59843 event pairs, 735 based on Foata normal form. 3/6511 useless extension candidates. Maximal degree in co-relation 10602. Up to 2475 conditions per place. [2022-01-18 21:51:49,155 INFO L132 encePairwiseOnDemand]: 254/274 looper letters, 118 selfloop transitions, 38 changer transitions 0/325 dead transitions. [2022-01-18 21:51:49,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 325 transitions, 1427 flow [2022-01-18 21:51:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 21:51:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-18 21:51:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2737 transitions. [2022-01-18 21:51:49,162 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6659367396593674 [2022-01-18 21:51:49,162 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2737 transitions. [2022-01-18 21:51:49,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2737 transitions. [2022-01-18 21:51:49,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:49,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2737 transitions. [2022-01-18 21:51:49,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 182.46666666666667) internal successors, (2737), 15 states have internal predecessors, (2737), 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) [2022-01-18 21:51:49,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 274.0) internal successors, (4384), 16 states have internal predecessors, (4384), 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) [2022-01-18 21:51:49,176 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 274.0) internal successors, (4384), 16 states have internal predecessors, (4384), 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) [2022-01-18 21:51:49,176 INFO L186 Difference]: Start difference. First operand has 311 places, 294 transitions, 994 flow. Second operand 15 states and 2737 transitions. [2022-01-18 21:51:49,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 325 transitions, 1427 flow [2022-01-18 21:51:49,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 325 transitions, 1395 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-01-18 21:51:49,187 INFO L242 Difference]: Finished difference. Result has 319 places, 300 transitions, 1140 flow [2022-01-18 21:51:49,188 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1140, PETRI_PLACES=319, PETRI_TRANSITIONS=300} [2022-01-18 21:51:49,188 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 65 predicate places. [2022-01-18 21:51:49,188 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 300 transitions, 1140 flow [2022-01-18 21:51:49,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 176.83333333333334) internal successors, (3183), 18 states have internal predecessors, (3183), 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) [2022-01-18 21:51:49,189 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:49,189 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:49,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 21:51:49,190 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 655539223, now seen corresponding path program 3 times [2022-01-18 21:51:49,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:49,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384986116] [2022-01-18 21:51:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:49,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:49,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:49,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384986116] [2022-01-18 21:51:49,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384986116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:49,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:49,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 21:51:49,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577966456] [2022-01-18 21:51:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:49,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 21:51:49,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 21:51:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-18 21:51:49,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-18 21:51:49,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 300 transitions, 1140 flow. Second operand has 18 states, 18 states have (on average 176.83333333333334) internal successors, (3183), 18 states have internal predecessors, (3183), 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) [2022-01-18 21:51:49,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:49,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-18 21:51:49,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:51,394 INFO L129 PetriNetUnfolder]: 1625/6840 cut-off events. [2022-01-18 21:51:51,395 INFO L130 PetriNetUnfolder]: For 1146/1150 co-relation queries the response was YES. [2022-01-18 21:51:51,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10698 conditions, 6840 events. 1625/6840 cut-off events. For 1146/1150 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 59992 event pairs, 741 based on Foata normal form. 6/6497 useless extension candidates. Maximal degree in co-relation 10664. Up to 2414 conditions per place. [2022-01-18 21:51:51,437 INFO L132 encePairwiseOnDemand]: 257/274 looper letters, 101 selfloop transitions, 36 changer transitions 0/306 dead transitions. [2022-01-18 21:51:51,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 306 transitions, 1422 flow [2022-01-18 21:51:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 21:51:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 21:51:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2535 transitions. [2022-01-18 21:51:51,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6608446298227321 [2022-01-18 21:51:51,442 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2535 transitions. [2022-01-18 21:51:51,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2535 transitions. [2022-01-18 21:51:51,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:51,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2535 transitions. [2022-01-18 21:51:51,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 181.07142857142858) internal successors, (2535), 14 states have internal predecessors, (2535), 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) [2022-01-18 21:51:51,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 274.0) internal successors, (4110), 15 states have internal predecessors, (4110), 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) [2022-01-18 21:51:51,453 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 274.0) internal successors, (4110), 15 states have internal predecessors, (4110), 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) [2022-01-18 21:51:51,453 INFO L186 Difference]: Start difference. First operand has 319 places, 300 transitions, 1140 flow. Second operand 14 states and 2535 transitions. [2022-01-18 21:51:51,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 306 transitions, 1422 flow [2022-01-18 21:51:51,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 306 transitions, 1386 flow, removed 4 selfloop flow, removed 11 redundant places. [2022-01-18 21:51:51,463 INFO L242 Difference]: Finished difference. Result has 319 places, 296 transitions, 1154 flow [2022-01-18 21:51:51,463 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1154, PETRI_PLACES=319, PETRI_TRANSITIONS=296} [2022-01-18 21:51:51,464 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 65 predicate places. [2022-01-18 21:51:51,464 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 296 transitions, 1154 flow [2022-01-18 21:51:51,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 176.83333333333334) internal successors, (3183), 18 states have internal predecessors, (3183), 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) [2022-01-18 21:51:51,465 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:51,465 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:51,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 21:51:51,465 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1000254974, now seen corresponding path program 1 times [2022-01-18 21:51:51,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589570925] [2022-01-18 21:51:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:51,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:52,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:52,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589570925] [2022-01-18 21:51:52,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589570925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:52,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:52,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 21:51:52,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027671627] [2022-01-18 21:51:52,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:52,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 21:51:52,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:52,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 21:51:52,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-01-18 21:51:52,910 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 274 [2022-01-18 21:51:52,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 296 transitions, 1154 flow. Second operand has 29 states, 29 states have (on average 163.13793103448276) internal successors, (4731), 29 states have internal predecessors, (4731), 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) [2022-01-18 21:51:52,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:52,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 274 [2022-01-18 21:51:52,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:55,732 INFO L129 PetriNetUnfolder]: 847/3524 cut-off events. [2022-01-18 21:51:55,732 INFO L130 PetriNetUnfolder]: For 1183/1186 co-relation queries the response was YES. [2022-01-18 21:51:55,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 3524 events. 847/3524 cut-off events. For 1183/1186 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24735 event pairs, 336 based on Foata normal form. 3/3355 useless extension candidates. Maximal degree in co-relation 5929. Up to 1081 conditions per place. [2022-01-18 21:51:55,757 INFO L132 encePairwiseOnDemand]: 245/274 looper letters, 121 selfloop transitions, 52 changer transitions 0/320 dead transitions. [2022-01-18 21:51:55,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 320 transitions, 1567 flow [2022-01-18 21:51:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-18 21:51:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-18 21:51:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4489 transitions. [2022-01-18 21:51:55,764 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6067856177345229 [2022-01-18 21:51:55,764 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4489 transitions. [2022-01-18 21:51:55,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4489 transitions. [2022-01-18 21:51:55,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:55,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4489 transitions. [2022-01-18 21:51:55,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 166.25925925925927) internal successors, (4489), 27 states have internal predecessors, (4489), 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) [2022-01-18 21:51:55,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 274.0) internal successors, (7672), 28 states have internal predecessors, (7672), 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) [2022-01-18 21:51:55,781 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 274.0) internal successors, (7672), 28 states have internal predecessors, (7672), 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) [2022-01-18 21:51:55,781 INFO L186 Difference]: Start difference. First operand has 319 places, 296 transitions, 1154 flow. Second operand 27 states and 4489 transitions. [2022-01-18 21:51:55,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 320 transitions, 1567 flow [2022-01-18 21:51:55,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 1475 flow, removed 1 selfloop flow, removed 21 redundant places. [2022-01-18 21:51:55,791 INFO L242 Difference]: Finished difference. Result has 318 places, 287 transitions, 1154 flow [2022-01-18 21:51:55,792 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1154, PETRI_PLACES=318, PETRI_TRANSITIONS=287} [2022-01-18 21:51:55,792 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 64 predicate places. [2022-01-18 21:51:55,792 INFO L470 AbstractCegarLoop]: Abstraction has has 318 places, 287 transitions, 1154 flow [2022-01-18 21:51:55,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 163.13793103448276) internal successors, (4731), 29 states have internal predecessors, (4731), 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) [2022-01-18 21:51:55,793 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:55,794 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:55,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 21:51:55,794 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1409670591, now seen corresponding path program 1 times [2022-01-18 21:51:55,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:55,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390675009] [2022-01-18 21:51:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:55,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:55,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:55,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390675009] [2022-01-18 21:51:55,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390675009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:55,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:55,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 21:51:55,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799908258] [2022-01-18 21:51:55,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:55,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 21:51:55,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:55,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 21:51:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 21:51:55,846 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 274 [2022-01-18 21:51:55,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 287 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2022-01-18 21:51:55,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:55,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 274 [2022-01-18 21:51:55,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:56,000 INFO L129 PetriNetUnfolder]: 62/911 cut-off events. [2022-01-18 21:51:56,000 INFO L130 PetriNetUnfolder]: For 544/545 co-relation queries the response was YES. [2022-01-18 21:51:56,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 911 events. 62/911 cut-off events. For 544/545 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3733 event pairs, 7 based on Foata normal form. 18/884 useless extension candidates. Maximal degree in co-relation 1455. Up to 39 conditions per place. [2022-01-18 21:51:56,005 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 12 selfloop transitions, 6 changer transitions 0/289 dead transitions. [2022-01-18 21:51:56,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 289 transitions, 1197 flow [2022-01-18 21:51:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 21:51:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 21:51:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2022-01-18 21:51:56,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9306569343065694 [2022-01-18 21:51:56,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2022-01-18 21:51:56,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2022-01-18 21:51:56,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:56,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2022-01-18 21:51:56,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 21:51:56,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2022-01-18 21:51:56,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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) [2022-01-18 21:51:56,009 INFO L186 Difference]: Start difference. First operand has 318 places, 287 transitions, 1154 flow. Second operand 3 states and 765 transitions. [2022-01-18 21:51:56,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 289 transitions, 1197 flow [2022-01-18 21:51:56,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 1103 flow, removed 2 selfloop flow, removed 23 redundant places. [2022-01-18 21:51:56,019 INFO L242 Difference]: Finished difference. Result has 297 places, 287 transitions, 1072 flow [2022-01-18 21:51:56,019 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=297, PETRI_TRANSITIONS=287} [2022-01-18 21:51:56,020 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 43 predicate places. [2022-01-18 21:51:56,020 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 287 transitions, 1072 flow [2022-01-18 21:51:56,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2022-01-18 21:51:56,020 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:56,021 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:56,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 21:51:56,021 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash -849021323, now seen corresponding path program 1 times [2022-01-18 21:51:56,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:56,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933890266] [2022-01-18 21:51:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:56,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:51:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:51:56,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:51:56,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933890266] [2022-01-18 21:51:56,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933890266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:51:56,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:51:56,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-18 21:51:56,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66818648] [2022-01-18 21:51:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:51:56,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-18 21:51:56,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:51:56,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-18 21:51:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-01-18 21:51:56,837 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 274 [2022-01-18 21:51:56,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 287 transitions, 1072 flow. Second operand has 29 states, 29 states have (on average 167.75862068965517) internal successors, (4865), 29 states have internal predecessors, (4865), 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) [2022-01-18 21:51:56,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:51:56,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 274 [2022-01-18 21:51:56,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:51:58,716 INFO L129 PetriNetUnfolder]: 393/1832 cut-off events. [2022-01-18 21:51:58,717 INFO L130 PetriNetUnfolder]: For 1081/1085 co-relation queries the response was YES. [2022-01-18 21:51:58,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 1832 events. 393/1832 cut-off events. For 1081/1085 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10089 event pairs, 43 based on Foata normal form. 0/1767 useless extension candidates. Maximal degree in co-relation 3766. Up to 359 conditions per place. [2022-01-18 21:51:58,729 INFO L132 encePairwiseOnDemand]: 243/274 looper letters, 141 selfloop transitions, 56 changer transitions 0/342 dead transitions. [2022-01-18 21:51:58,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 342 transitions, 1639 flow [2022-01-18 21:51:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-18 21:51:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-18 21:51:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4780 transitions. [2022-01-18 21:51:58,737 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6230448383733055 [2022-01-18 21:51:58,737 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4780 transitions. [2022-01-18 21:51:58,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4780 transitions. [2022-01-18 21:51:58,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:51:58,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4780 transitions. [2022-01-18 21:51:58,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 170.71428571428572) internal successors, (4780), 28 states have internal predecessors, (4780), 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) [2022-01-18 21:51:58,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 274.0) internal successors, (7946), 29 states have internal predecessors, (7946), 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) [2022-01-18 21:51:58,754 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 274.0) internal successors, (7946), 29 states have internal predecessors, (7946), 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) [2022-01-18 21:51:58,754 INFO L186 Difference]: Start difference. First operand has 297 places, 287 transitions, 1072 flow. Second operand 28 states and 4780 transitions. [2022-01-18 21:51:58,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 342 transitions, 1639 flow [2022-01-18 21:51:58,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 342 transitions, 1633 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 21:51:58,765 INFO L242 Difference]: Finished difference. Result has 328 places, 294 transitions, 1223 flow [2022-01-18 21:51:58,765 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1223, PETRI_PLACES=328, PETRI_TRANSITIONS=294} [2022-01-18 21:51:58,766 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 74 predicate places. [2022-01-18 21:51:58,766 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 294 transitions, 1223 flow [2022-01-18 21:51:58,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 167.75862068965517) internal successors, (4865), 29 states have internal predecessors, (4865), 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) [2022-01-18 21:51:58,767 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:51:58,767 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:51:58,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 21:51:58,768 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:51:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:51:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash 390492704, now seen corresponding path program 1 times [2022-01-18 21:51:58,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:51:58,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296344873] [2022-01-18 21:51:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:51:58,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:51:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:52:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:52:00,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:52:00,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296344873] [2022-01-18 21:52:00,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296344873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:52:00,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:52:00,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-18 21:52:00,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978567756] [2022-01-18 21:52:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:52:00,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-18 21:52:00,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:52:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-18 21:52:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2022-01-18 21:52:00,897 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 274 [2022-01-18 21:52:00,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 294 transitions, 1223 flow. Second operand has 33 states, 33 states have (on average 155.75757575757575) internal successors, (5140), 33 states have internal predecessors, (5140), 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) [2022-01-18 21:52:00,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:52:00,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 274 [2022-01-18 21:52:00,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:52:04,743 INFO L129 PetriNetUnfolder]: 539/2370 cut-off events. [2022-01-18 21:52:04,743 INFO L130 PetriNetUnfolder]: For 1650/1654 co-relation queries the response was YES. [2022-01-18 21:52:04,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5107 conditions, 2370 events. 539/2370 cut-off events. For 1650/1654 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 14219 event pairs, 59 based on Foata normal form. 0/2297 useless extension candidates. Maximal degree in co-relation 5071. Up to 378 conditions per place. [2022-01-18 21:52:04,776 INFO L132 encePairwiseOnDemand]: 234/274 looper letters, 184 selfloop transitions, 66 changer transitions 0/386 dead transitions. [2022-01-18 21:52:04,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 386 transitions, 2006 flow [2022-01-18 21:52:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-18 21:52:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-01-18 21:52:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5564 transitions. [2022-01-18 21:52:04,783 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5801876955161627 [2022-01-18 21:52:04,784 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 5564 transitions. [2022-01-18 21:52:04,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 5564 transitions. [2022-01-18 21:52:04,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:52:04,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5564 transitions. [2022-01-18 21:52:04,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 158.97142857142856) internal successors, (5564), 35 states have internal predecessors, (5564), 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) [2022-01-18 21:52:04,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 274.0) internal successors, (9864), 36 states have internal predecessors, (9864), 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) [2022-01-18 21:52:04,803 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 274.0) internal successors, (9864), 36 states have internal predecessors, (9864), 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) [2022-01-18 21:52:04,803 INFO L186 Difference]: Start difference. First operand has 328 places, 294 transitions, 1223 flow. Second operand 35 states and 5564 transitions. [2022-01-18 21:52:04,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 386 transitions, 2006 flow [2022-01-18 21:52:04,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 386 transitions, 1910 flow, removed 0 selfloop flow, removed 21 redundant places. [2022-01-18 21:52:04,817 INFO L242 Difference]: Finished difference. Result has 351 places, 309 transitions, 1373 flow [2022-01-18 21:52:04,817 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1373, PETRI_PLACES=351, PETRI_TRANSITIONS=309} [2022-01-18 21:52:04,818 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 97 predicate places. [2022-01-18 21:52:04,818 INFO L470 AbstractCegarLoop]: Abstraction has has 351 places, 309 transitions, 1373 flow [2022-01-18 21:52:04,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 155.75757575757575) internal successors, (5140), 33 states have internal predecessors, (5140), 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) [2022-01-18 21:52:04,819 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:52:04,819 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:52:04,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 21:52:04,819 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:52:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:52:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash 538588479, now seen corresponding path program 1 times [2022-01-18 21:52:04,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:52:04,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975002532] [2022-01-18 21:52:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:52:04,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:52:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:52:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:52:31,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:52:31,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975002532] [2022-01-18 21:52:31,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975002532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:52:31,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:52:31,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-18 21:52:31,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330796003] [2022-01-18 21:52:31,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:52:31,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-18 21:52:31,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:52:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-18 21:52:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 21:52:31,384 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:52:31,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 309 transitions, 1373 flow. Second operand has 48 states, 48 states have (on average 133.3125) internal successors, (6399), 48 states have internal predecessors, (6399), 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) [2022-01-18 21:52:31,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:52:31,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:52:31,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:52:48,992 INFO L129 PetriNetUnfolder]: 5938/14612 cut-off events. [2022-01-18 21:52:48,992 INFO L130 PetriNetUnfolder]: For 7358/7359 co-relation queries the response was YES. [2022-01-18 21:52:49,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31956 conditions, 14612 events. 5938/14612 cut-off events. For 7358/7359 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 115448 event pairs, 992 based on Foata normal form. 0/13692 useless extension candidates. Maximal degree in co-relation 31910. Up to 4690 conditions per place. [2022-01-18 21:52:49,109 INFO L132 encePairwiseOnDemand]: 215/274 looper letters, 561 selfloop transitions, 165 changer transitions 57/903 dead transitions. [2022-01-18 21:52:49,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 903 transitions, 4669 flow [2022-01-18 21:52:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-18 21:52:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-01-18 21:52:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 10699 transitions. [2022-01-18 21:52:49,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5137821744141375 [2022-01-18 21:52:49,120 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 10699 transitions. [2022-01-18 21:52:49,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 10699 transitions. [2022-01-18 21:52:49,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:52:49,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 10699 transitions. [2022-01-18 21:52:49,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 140.77631578947367) internal successors, (10699), 76 states have internal predecessors, (10699), 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) [2022-01-18 21:52:49,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 274.0) internal successors, (21098), 77 states have internal predecessors, (21098), 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) [2022-01-18 21:52:49,154 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 274.0) internal successors, (21098), 77 states have internal predecessors, (21098), 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) [2022-01-18 21:52:49,154 INFO L186 Difference]: Start difference. First operand has 351 places, 309 transitions, 1373 flow. Second operand 76 states and 10699 transitions. [2022-01-18 21:52:49,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 903 transitions, 4669 flow [2022-01-18 21:52:49,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 903 transitions, 4520 flow, removed 15 selfloop flow, removed 22 redundant places. [2022-01-18 21:52:49,208 INFO L242 Difference]: Finished difference. Result has 456 places, 420 transitions, 2514 flow [2022-01-18 21:52:49,208 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=2514, PETRI_PLACES=456, PETRI_TRANSITIONS=420} [2022-01-18 21:52:49,209 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 202 predicate places. [2022-01-18 21:52:49,209 INFO L470 AbstractCegarLoop]: Abstraction has has 456 places, 420 transitions, 2514 flow [2022-01-18 21:52:49,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 133.3125) internal successors, (6399), 48 states have internal predecessors, (6399), 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) [2022-01-18 21:52:49,210 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:52:49,211 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:52:49,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 21:52:49,211 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:52:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:52:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1559785829, now seen corresponding path program 2 times [2022-01-18 21:52:49,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:52:49,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309647844] [2022-01-18 21:52:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:52:49,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:52:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:52:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:52:52,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:52:52,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309647844] [2022-01-18 21:52:52,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309647844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:52:52,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:52:52,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 21:52:52,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339487653] [2022-01-18 21:52:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:52:52,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 21:52:52,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:52:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 21:52:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 21:52:52,149 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:52:52,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 420 transitions, 2514 flow. Second operand has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:52:52,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:52:52,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:52:52,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:53:06,488 INFO L129 PetriNetUnfolder]: 7561/18001 cut-off events. [2022-01-18 21:53:06,488 INFO L130 PetriNetUnfolder]: For 151418/151495 co-relation queries the response was YES. [2022-01-18 21:53:06,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63866 conditions, 18001 events. 7561/18001 cut-off events. For 151418/151495 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 146066 event pairs, 2802 based on Foata normal form. 178/17841 useless extension candidates. Maximal degree in co-relation 63768. Up to 10243 conditions per place. [2022-01-18 21:53:06,714 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 534 selfloop transitions, 134 changer transitions 45/833 dead transitions. [2022-01-18 21:53:06,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 833 transitions, 6691 flow [2022-01-18 21:53:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-18 21:53:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-18 21:53:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10122 transitions. [2022-01-18 21:53:06,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.506049395060494 [2022-01-18 21:53:06,730 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10122 transitions. [2022-01-18 21:53:06,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10122 transitions. [2022-01-18 21:53:06,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:53:06,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10122 transitions. [2022-01-18 21:53:06,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 138.65753424657535) internal successors, (10122), 73 states have internal predecessors, (10122), 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) [2022-01-18 21:53:06,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 274.0) internal successors, (20276), 74 states have internal predecessors, (20276), 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) [2022-01-18 21:53:06,760 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 274.0) internal successors, (20276), 74 states have internal predecessors, (20276), 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) [2022-01-18 21:53:06,761 INFO L186 Difference]: Start difference. First operand has 456 places, 420 transitions, 2514 flow. Second operand 73 states and 10122 transitions. [2022-01-18 21:53:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 833 transitions, 6691 flow [2022-01-18 21:53:07,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 833 transitions, 6568 flow, removed 19 selfloop flow, removed 17 redundant places. [2022-01-18 21:53:07,094 INFO L242 Difference]: Finished difference. Result has 547 places, 544 transitions, 4430 flow [2022-01-18 21:53:07,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=4430, PETRI_PLACES=547, PETRI_TRANSITIONS=544} [2022-01-18 21:53:07,095 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 293 predicate places. [2022-01-18 21:53:07,095 INFO L470 AbstractCegarLoop]: Abstraction has has 547 places, 544 transitions, 4430 flow [2022-01-18 21:53:07,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:53:07,096 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:53:07,097 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:53:07,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 21:53:07,097 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:53:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:53:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2136658691, now seen corresponding path program 3 times [2022-01-18 21:53:07,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:53:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532505789] [2022-01-18 21:53:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:53:07,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:53:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:53:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:53:32,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:53:32,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532505789] [2022-01-18 21:53:32,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532505789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:53:32,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:53:32,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 21:53:32,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696203910] [2022-01-18 21:53:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:53:32,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 21:53:32,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:53:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 21:53:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1982, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 21:53:32,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-18 21:53:32,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 544 transitions, 4430 flow. Second operand has 47 states, 47 states have (on average 136.29787234042553) internal successors, (6406), 47 states have internal predecessors, (6406), 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) [2022-01-18 21:53:32,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:53:32,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-18 21:53:32,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:53:50,914 INFO L129 PetriNetUnfolder]: 8188/20063 cut-off events. [2022-01-18 21:53:50,914 INFO L130 PetriNetUnfolder]: For 545578/545707 co-relation queries the response was YES. [2022-01-18 21:53:51,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84554 conditions, 20063 events. 8188/20063 cut-off events. For 545578/545707 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 170370 event pairs, 2092 based on Foata normal form. 180/19850 useless extension candidates. Maximal degree in co-relation 84420. Up to 10526 conditions per place. [2022-01-18 21:53:51,175 INFO L132 encePairwiseOnDemand]: 221/274 looper letters, 624 selfloop transitions, 135 changer transitions 6/897 dead transitions. [2022-01-18 21:53:51,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 897 transitions, 9013 flow [2022-01-18 21:53:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 21:53:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-18 21:53:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 9204 transitions. [2022-01-18 21:53:51,184 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5167883211678832 [2022-01-18 21:53:51,185 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 9204 transitions. [2022-01-18 21:53:51,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 9204 transitions. [2022-01-18 21:53:51,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:53:51,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 9204 transitions. [2022-01-18 21:53:51,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 141.6) internal successors, (9204), 65 states have internal predecessors, (9204), 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) [2022-01-18 21:53:51,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 274.0) internal successors, (18084), 66 states have internal predecessors, (18084), 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) [2022-01-18 21:53:51,210 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 274.0) internal successors, (18084), 66 states have internal predecessors, (18084), 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) [2022-01-18 21:53:51,210 INFO L186 Difference]: Start difference. First operand has 547 places, 544 transitions, 4430 flow. Second operand 65 states and 9204 transitions. [2022-01-18 21:53:51,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 897 transitions, 9013 flow [2022-01-18 21:53:52,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 897 transitions, 8102 flow, removed 441 selfloop flow, removed 12 redundant places. [2022-01-18 21:53:52,304 INFO L242 Difference]: Finished difference. Result has 627 places, 624 transitions, 5191 flow [2022-01-18 21:53:52,305 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=5191, PETRI_PLACES=627, PETRI_TRANSITIONS=624} [2022-01-18 21:53:52,305 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 373 predicate places. [2022-01-18 21:53:52,305 INFO L470 AbstractCegarLoop]: Abstraction has has 627 places, 624 transitions, 5191 flow [2022-01-18 21:53:52,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 136.29787234042553) internal successors, (6406), 47 states have internal predecessors, (6406), 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) [2022-01-18 21:53:52,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:53:52,306 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:53:52,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-18 21:53:52,306 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:53:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:53:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1185275489, now seen corresponding path program 4 times [2022-01-18 21:53:52,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:53:52,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963445905] [2022-01-18 21:53:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:53:52,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:53:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:54:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:54:11,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:54:11,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963445905] [2022-01-18 21:54:11,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963445905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:54:11,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:54:11,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-01-18 21:54:11,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681880357] [2022-01-18 21:54:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:54:11,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-18 21:54:11,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:54:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-18 21:54:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1889, Unknown=0, NotChecked=0, Total=2070 [2022-01-18 21:54:11,750 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-18 21:54:11,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 624 transitions, 5191 flow. Second operand has 46 states, 46 states have (on average 136.34782608695653) internal successors, (6272), 46 states have internal predecessors, (6272), 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) [2022-01-18 21:54:11,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:54:11,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-18 21:54:11,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:54:27,765 INFO L129 PetriNetUnfolder]: 9243/22646 cut-off events. [2022-01-18 21:54:27,765 INFO L130 PetriNetUnfolder]: For 1086912/1087089 co-relation queries the response was YES. [2022-01-18 21:54:28,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103624 conditions, 22646 events. 9243/22646 cut-off events. For 1086912/1087089 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 198009 event pairs, 3298 based on Foata normal form. 158/22341 useless extension candidates. Maximal degree in co-relation 103462. Up to 13523 conditions per place. [2022-01-18 21:54:28,359 INFO L132 encePairwiseOnDemand]: 221/274 looper letters, 694 selfloop transitions, 112 changer transitions 2/940 dead transitions. [2022-01-18 21:54:28,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 940 transitions, 9379 flow [2022-01-18 21:54:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-18 21:54:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-18 21:54:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 8364 transitions. [2022-01-18 21:54:28,369 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5173821600890759 [2022-01-18 21:54:28,370 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 8364 transitions. [2022-01-18 21:54:28,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 8364 transitions. [2022-01-18 21:54:28,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:54:28,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 8364 transitions. [2022-01-18 21:54:28,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 141.76271186440678) internal successors, (8364), 59 states have internal predecessors, (8364), 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) [2022-01-18 21:54:28,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 274.0) internal successors, (16440), 60 states have internal predecessors, (16440), 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) [2022-01-18 21:54:28,398 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 274.0) internal successors, (16440), 60 states have internal predecessors, (16440), 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) [2022-01-18 21:54:28,398 INFO L186 Difference]: Start difference. First operand has 627 places, 624 transitions, 5191 flow. Second operand 59 states and 8364 transitions. [2022-01-18 21:54:28,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 940 transitions, 9379 flow [2022-01-18 21:54:30,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 940 transitions, 8779 flow, removed 242 selfloop flow, removed 20 redundant places. [2022-01-18 21:54:30,459 INFO L242 Difference]: Finished difference. Result has 694 places, 696 transitions, 6156 flow [2022-01-18 21:54:30,460 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=4625, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=6156, PETRI_PLACES=694, PETRI_TRANSITIONS=696} [2022-01-18 21:54:30,460 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 440 predicate places. [2022-01-18 21:54:30,460 INFO L470 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 6156 flow [2022-01-18 21:54:30,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 136.34782608695653) internal successors, (6272), 46 states have internal predecessors, (6272), 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) [2022-01-18 21:54:30,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:54:30,461 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:54:30,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 21:54:30,461 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:54:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:54:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1266799135, now seen corresponding path program 5 times [2022-01-18 21:54:30,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:54:30,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576542923] [2022-01-18 21:54:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:54:30,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:54:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:54:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:54:33,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:54:33,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576542923] [2022-01-18 21:54:33,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576542923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:54:33,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:54:33,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 21:54:33,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928737455] [2022-01-18 21:54:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:54:33,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 21:54:33,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:54:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 21:54:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1995, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 21:54:33,527 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:54:33,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 696 transitions, 6156 flow. Second operand has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:54:33,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:54:33,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:54:33,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:54:54,368 INFO L129 PetriNetUnfolder]: 10916/25839 cut-off events. [2022-01-18 21:54:54,368 INFO L130 PetriNetUnfolder]: For 2312903/2313058 co-relation queries the response was YES. [2022-01-18 21:54:55,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137027 conditions, 25839 events. 10916/25839 cut-off events. For 2312903/2313058 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 227486 event pairs, 3747 based on Foata normal form. 162/25490 useless extension candidates. Maximal degree in co-relation 136839. Up to 16035 conditions per place. [2022-01-18 21:54:55,088 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 805 selfloop transitions, 151 changer transitions 7/1083 dead transitions. [2022-01-18 21:54:55,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 1083 transitions, 11766 flow [2022-01-18 21:54:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-18 21:54:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-18 21:54:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10092 transitions. [2022-01-18 21:54:55,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5045495450454954 [2022-01-18 21:54:55,096 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10092 transitions. [2022-01-18 21:54:55,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10092 transitions. [2022-01-18 21:54:55,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:54:55,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10092 transitions. [2022-01-18 21:54:55,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 138.24657534246575) internal successors, (10092), 73 states have internal predecessors, (10092), 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) [2022-01-18 21:54:55,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 274.0) internal successors, (20276), 74 states have internal predecessors, (20276), 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) [2022-01-18 21:54:55,131 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 274.0) internal successors, (20276), 74 states have internal predecessors, (20276), 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) [2022-01-18 21:54:55,131 INFO L186 Difference]: Start difference. First operand has 694 places, 696 transitions, 6156 flow. Second operand 73 states and 10092 transitions. [2022-01-18 21:54:55,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 1083 transitions, 11766 flow [2022-01-18 21:54:58,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 1083 transitions, 11189 flow, removed 271 selfloop flow, removed 14 redundant places. [2022-01-18 21:54:58,324 INFO L242 Difference]: Finished difference. Result has 784 places, 804 transitions, 7788 flow [2022-01-18 21:54:58,325 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=5579, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=7788, PETRI_PLACES=784, PETRI_TRANSITIONS=804} [2022-01-18 21:54:58,325 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 530 predicate places. [2022-01-18 21:54:58,326 INFO L470 AbstractCegarLoop]: Abstraction has has 784 places, 804 transitions, 7788 flow [2022-01-18 21:54:58,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:54:58,327 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:54:58,327 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:54:58,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-18 21:54:58,327 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:54:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:54:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1722317643, now seen corresponding path program 6 times [2022-01-18 21:54:58,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:54:58,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592032602] [2022-01-18 21:54:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:54:58,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:54:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:55:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:55:01,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:55:01,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592032602] [2022-01-18 21:55:01,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592032602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:55:01,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:55:01,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 21:55:01,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311593805] [2022-01-18 21:55:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:55:01,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 21:55:01,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:55:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 21:55:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 21:55:01,294 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:55:01,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 784 places, 804 transitions, 7788 flow. Second operand has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:55:01,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:55:01,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:55:01,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:55:24,605 INFO L129 PetriNetUnfolder]: 11965/28276 cut-off events. [2022-01-18 21:55:24,606 INFO L130 PetriNetUnfolder]: For 3523044/3523221 co-relation queries the response was YES. [2022-01-18 21:55:25,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162271 conditions, 28276 events. 11965/28276 cut-off events. For 3523044/3523221 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 253337 event pairs, 3044 based on Foata normal form. 140/27845 useless extension candidates. Maximal degree in co-relation 162051. Up to 16181 conditions per place. [2022-01-18 21:55:25,919 INFO L132 encePairwiseOnDemand]: 216/274 looper letters, 870 selfloop transitions, 212 changer transitions 11/1213 dead transitions. [2022-01-18 21:55:25,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 1213 transitions, 15256 flow [2022-01-18 21:55:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-18 21:55:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-01-18 21:55:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 10394 transitions. [2022-01-18 21:55:25,928 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5057907542579075 [2022-01-18 21:55:25,928 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 10394 transitions. [2022-01-18 21:55:25,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 10394 transitions. [2022-01-18 21:55:25,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:55:25,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 10394 transitions. [2022-01-18 21:55:25,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 138.58666666666667) internal successors, (10394), 75 states have internal predecessors, (10394), 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) [2022-01-18 21:55:25,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 274.0) internal successors, (20824), 76 states have internal predecessors, (20824), 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) [2022-01-18 21:55:25,967 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 274.0) internal successors, (20824), 76 states have internal predecessors, (20824), 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) [2022-01-18 21:55:25,967 INFO L186 Difference]: Start difference. First operand has 784 places, 804 transitions, 7788 flow. Second operand 75 states and 10394 transitions. [2022-01-18 21:55:25,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 1213 transitions, 15256 flow [2022-01-18 21:55:31,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 1213 transitions, 14278 flow, removed 465 selfloop flow, removed 14 redundant places. [2022-01-18 21:55:31,381 INFO L242 Difference]: Finished difference. Result has 875 places, 908 transitions, 9357 flow [2022-01-18 21:55:31,382 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=6810, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=9357, PETRI_PLACES=875, PETRI_TRANSITIONS=908} [2022-01-18 21:55:31,383 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 621 predicate places. [2022-01-18 21:55:31,383 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 908 transitions, 9357 flow [2022-01-18 21:55:31,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:55:31,384 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:55:31,384 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:55:31,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-18 21:55:31,384 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:55:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:55:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 237417657, now seen corresponding path program 7 times [2022-01-18 21:55:31,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:55:31,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011360987] [2022-01-18 21:55:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:55:31,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:55:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:55:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:55:34,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:55:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011360987] [2022-01-18 21:55:34,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011360987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:55:34,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:55:34,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 21:55:34,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207821236] [2022-01-18 21:55:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:55:34,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 21:55:34,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:55:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 21:55:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1992, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 21:55:34,230 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:55:34,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 908 transitions, 9357 flow. Second operand has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:55:34,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:55:34,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:55:34,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:55:59,117 INFO L129 PetriNetUnfolder]: 13049/30808 cut-off events. [2022-01-18 21:55:59,117 INFO L130 PetriNetUnfolder]: For 5126873/5127148 co-relation queries the response was YES. [2022-01-18 21:56:00,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188057 conditions, 30808 events. 13049/30808 cut-off events. For 5126873/5127148 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 281302 event pairs, 3404 based on Foata normal form. 156/30340 useless extension candidates. Maximal degree in co-relation 187806. Up to 18055 conditions per place. [2022-01-18 21:56:00,308 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 972 selfloop transitions, 204 changer transitions 9/1305 dead transitions. [2022-01-18 21:56:00,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1305 transitions, 17067 flow [2022-01-18 21:56:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-18 21:56:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-18 21:56:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 10251 transitions. [2022-01-18 21:56:00,315 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5055730913395147 [2022-01-18 21:56:00,315 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 10251 transitions. [2022-01-18 21:56:00,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 10251 transitions. [2022-01-18 21:56:00,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:00,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 10251 transitions. [2022-01-18 21:56:00,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 138.52702702702703) internal successors, (10251), 74 states have internal predecessors, (10251), 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) [2022-01-18 21:56:00,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 274.0) internal successors, (20550), 75 states have internal predecessors, (20550), 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) [2022-01-18 21:56:00,338 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 274.0) internal successors, (20550), 75 states have internal predecessors, (20550), 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) [2022-01-18 21:56:00,338 INFO L186 Difference]: Start difference. First operand has 875 places, 908 transitions, 9357 flow. Second operand 74 states and 10251 transitions. [2022-01-18 21:56:00,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1305 transitions, 17067 flow [2022-01-18 21:56:09,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 1305 transitions, 15685 flow, removed 596 selfloop flow, removed 19 redundant places. [2022-01-18 21:56:09,261 INFO L242 Difference]: Finished difference. Result has 960 places, 1008 transitions, 10659 flow [2022-01-18 21:56:09,261 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=7980, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=10659, PETRI_PLACES=960, PETRI_TRANSITIONS=1008} [2022-01-18 21:56:09,262 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 706 predicate places. [2022-01-18 21:56:09,262 INFO L470 AbstractCegarLoop]: Abstraction has has 960 places, 1008 transitions, 10659 flow [2022-01-18 21:56:09,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:56:09,263 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:09,263 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:09,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-18 21:56:09,263 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:56:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 802123773, now seen corresponding path program 8 times [2022-01-18 21:56:09,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872165429] [2022-01-18 21:56:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:09,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:12,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872165429] [2022-01-18 21:56:12,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872165429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:12,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:12,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 21:56:12,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494132332] [2022-01-18 21:56:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:12,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 21:56:12,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 21:56:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 21:56:12,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:56:12,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 1008 transitions, 10659 flow. Second operand has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:56:12,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:12,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:56:12,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:56:38,232 INFO L129 PetriNetUnfolder]: 14065/33158 cut-off events. [2022-01-18 21:56:38,232 INFO L130 PetriNetUnfolder]: For 6611060/6611405 co-relation queries the response was YES. [2022-01-18 21:56:40,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212791 conditions, 33158 events. 14065/33158 cut-off events. For 6611060/6611405 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 307349 event pairs, 3834 based on Foata normal form. 120/32584 useless extension candidates. Maximal degree in co-relation 212509. Up to 19498 conditions per place. [2022-01-18 21:56:40,576 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 1049 selfloop transitions, 239 changer transitions 13/1421 dead transitions. [2022-01-18 21:56:40,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 1421 transitions, 20267 flow [2022-01-18 21:56:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-18 21:56:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-01-18 21:56:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 10671 transitions. [2022-01-18 21:56:40,582 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5057825386292539 [2022-01-18 21:56:40,582 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 10671 transitions. [2022-01-18 21:56:40,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 10671 transitions. [2022-01-18 21:56:40,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:56:40,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 10671 transitions. [2022-01-18 21:56:40,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 138.58441558441558) internal successors, (10671), 77 states have internal predecessors, (10671), 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) [2022-01-18 21:56:40,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 274.0) internal successors, (21372), 78 states have internal predecessors, (21372), 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) [2022-01-18 21:56:40,609 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 274.0) internal successors, (21372), 78 states have internal predecessors, (21372), 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) [2022-01-18 21:56:40,609 INFO L186 Difference]: Start difference. First operand has 960 places, 1008 transitions, 10659 flow. Second operand 77 states and 10671 transitions. [2022-01-18 21:56:40,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1036 places, 1421 transitions, 20267 flow [2022-01-18 21:56:51,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1421 transitions, 18771 flow, removed 681 selfloop flow, removed 18 redundant places. [2022-01-18 21:56:51,391 INFO L242 Difference]: Finished difference. Result has 1046 places, 1105 transitions, 12033 flow [2022-01-18 21:56:51,392 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=9185, PETRI_DIFFERENCE_MINUEND_PLACES=942, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=12033, PETRI_PLACES=1046, PETRI_TRANSITIONS=1105} [2022-01-18 21:56:51,392 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 792 predicate places. [2022-01-18 21:56:51,392 INFO L470 AbstractCegarLoop]: Abstraction has has 1046 places, 1105 transitions, 12033 flow [2022-01-18 21:56:51,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 133.36170212765958) internal successors, (6268), 47 states have internal predecessors, (6268), 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) [2022-01-18 21:56:51,393 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:56:51,393 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:56:51,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-18 21:56:51,393 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:56:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:56:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 182655999, now seen corresponding path program 9 times [2022-01-18 21:56:51,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:56:51,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220945598] [2022-01-18 21:56:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:56:51,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:56:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:56:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:56:53,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:56:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220945598] [2022-01-18 21:56:53,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220945598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:56:53,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:56:53,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-18 21:56:53,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838139288] [2022-01-18 21:56:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:56:53,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-18 21:56:53,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:56:53,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-18 21:56:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 21:56:53,847 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2022-01-18 21:56:53,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1105 transitions, 12033 flow. Second operand has 48 states, 48 states have (on average 130.3125) internal successors, (6255), 48 states have internal predecessors, (6255), 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) [2022-01-18 21:56:53,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:56:53,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2022-01-18 21:56:53,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:57:20,535 INFO L129 PetriNetUnfolder]: 14881/35239 cut-off events. [2022-01-18 21:57:20,535 INFO L130 PetriNetUnfolder]: For 8370912/8371342 co-relation queries the response was YES. [2022-01-18 21:57:22,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235297 conditions, 35239 events. 14881/35239 cut-off events. For 8370912/8371342 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 331651 event pairs, 3085 based on Foata normal form. 158/34666 useless extension candidates. Maximal degree in co-relation 234988. Up to 18435 conditions per place. [2022-01-18 21:57:22,225 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1078 selfloop transitions, 263 changer transitions 20/1508 dead transitions. [2022-01-18 21:57:22,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1115 places, 1508 transitions, 22334 flow [2022-01-18 21:57:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 21:57:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-01-18 21:57:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 9548 transitions. [2022-01-18 21:57:22,230 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4978102189781022 [2022-01-18 21:57:22,230 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 9548 transitions. [2022-01-18 21:57:22,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 9548 transitions. [2022-01-18 21:57:22,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:57:22,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 9548 transitions. [2022-01-18 21:57:22,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 136.4) internal successors, (9548), 70 states have internal predecessors, (9548), 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) [2022-01-18 21:57:22,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 274.0) internal successors, (19454), 71 states have internal predecessors, (19454), 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) [2022-01-18 21:57:22,253 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 274.0) internal successors, (19454), 71 states have internal predecessors, (19454), 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) [2022-01-18 21:57:22,253 INFO L186 Difference]: Start difference. First operand has 1046 places, 1105 transitions, 12033 flow. Second operand 70 states and 9548 transitions. [2022-01-18 21:57:22,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1115 places, 1508 transitions, 22334 flow [2022-01-18 21:57:39,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1092 places, 1508 transitions, 20574 flow, removed 750 selfloop flow, removed 23 redundant places. [2022-01-18 21:57:39,082 INFO L242 Difference]: Finished difference. Result has 1116 places, 1187 transitions, 13014 flow [2022-01-18 21:57:39,083 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=10273, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=13014, PETRI_PLACES=1116, PETRI_TRANSITIONS=1187} [2022-01-18 21:57:39,084 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 862 predicate places. [2022-01-18 21:57:39,084 INFO L470 AbstractCegarLoop]: Abstraction has has 1116 places, 1187 transitions, 13014 flow [2022-01-18 21:57:39,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 130.3125) internal successors, (6255), 48 states have internal predecessors, (6255), 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) [2022-01-18 21:57:39,085 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:57:39,085 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:57:39,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-18 21:57:39,085 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:57:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:57:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1265422235, now seen corresponding path program 10 times [2022-01-18 21:57:39,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:57:39,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712180874] [2022-01-18 21:57:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:57:39,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:57:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:57:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:57:58,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:57:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712180874] [2022-01-18 21:57:58,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712180874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:57:58,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:57:58,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-18 21:57:58,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719099172] [2022-01-18 21:57:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:57:58,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-18 21:57:58,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:57:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-18 21:57:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 21:57:58,571 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-18 21:57:58,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 1187 transitions, 13014 flow. Second operand has 48 states, 48 states have (on average 133.3125) internal successors, (6399), 48 states have internal predecessors, (6399), 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) [2022-01-18 21:57:58,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:57:58,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-18 21:57:58,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:58:29,842 INFO L129 PetriNetUnfolder]: 15696/37021 cut-off events. [2022-01-18 21:58:29,842 INFO L130 PetriNetUnfolder]: For 8648233/8648598 co-relation queries the response was YES. [2022-01-18 21:58:31,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231576 conditions, 37021 events. 15696/37021 cut-off events. For 8648233/8648598 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 352979 event pairs, 5419 based on Foata normal form. 160/36393 useless extension candidates. Maximal degree in co-relation 231243. Up to 24245 conditions per place. [2022-01-18 21:58:32,352 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1272 selfloop transitions, 138 changer transitions 3/1534 dead transitions. [2022-01-18 21:58:32,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1178 places, 1534 transitions, 21053 flow [2022-01-18 21:58:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-18 21:58:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-18 21:58:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 8744 transitions. [2022-01-18 21:58:32,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5065461707797474 [2022-01-18 21:58:32,358 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 8744 transitions. [2022-01-18 21:58:32,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 8744 transitions. [2022-01-18 21:58:32,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:58:32,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 8744 transitions. [2022-01-18 21:58:32,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 138.79365079365078) internal successors, (8744), 63 states have internal predecessors, (8744), 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) [2022-01-18 21:58:32,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 274.0) internal successors, (17536), 64 states have internal predecessors, (17536), 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) [2022-01-18 21:58:32,375 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 274.0) internal successors, (17536), 64 states have internal predecessors, (17536), 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) [2022-01-18 21:58:32,375 INFO L186 Difference]: Start difference. First operand has 1116 places, 1187 transitions, 13014 flow. Second operand 63 states and 8744 transitions. [2022-01-18 21:58:32,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1178 places, 1534 transitions, 21053 flow [2022-01-18 21:58:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1152 places, 1534 transitions, 19385 flow, removed 687 selfloop flow, removed 26 redundant places. [2022-01-18 21:58:49,104 INFO L242 Difference]: Finished difference. Result has 1184 places, 1266 transitions, 14025 flow [2022-01-18 21:58:49,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=11389, PETRI_DIFFERENCE_MINUEND_PLACES=1090, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1078, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=14025, PETRI_PLACES=1184, PETRI_TRANSITIONS=1266} [2022-01-18 21:58:49,106 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 930 predicate places. [2022-01-18 21:58:49,106 INFO L470 AbstractCegarLoop]: Abstraction has has 1184 places, 1266 transitions, 14025 flow [2022-01-18 21:58:49,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 133.3125) internal successors, (6399), 48 states have internal predecessors, (6399), 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) [2022-01-18 21:58:49,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 21:58:49,108 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 21:58:49,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-18 21:58:49,108 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 21:58:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 21:58:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash -730839727, now seen corresponding path program 11 times [2022-01-18 21:58:49,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 21:58:49,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491360981] [2022-01-18 21:58:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 21:58:49,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 21:58:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 21:59:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 21:59:09,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 21:59:09,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491360981] [2022-01-18 21:59:09,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491360981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 21:59:09,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 21:59:09,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-01-18 21:59:09,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321733803] [2022-01-18 21:59:09,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 21:59:09,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 21:59:09,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 21:59:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 21:59:09,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2395, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 21:59:09,832 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2022-01-18 21:59:09,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1184 places, 1266 transitions, 14025 flow. Second operand has 51 states, 51 states have (on average 130.1764705882353) internal successors, (6639), 51 states have internal predecessors, (6639), 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) [2022-01-18 21:59:09,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 21:59:09,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2022-01-18 21:59:09,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 21:59:46,007 INFO L129 PetriNetUnfolder]: 16406/39049 cut-off events. [2022-01-18 21:59:46,007 INFO L130 PetriNetUnfolder]: For 10193442/10193776 co-relation queries the response was YES. [2022-01-18 21:59:48,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 247168 conditions, 39049 events. 16406/39049 cut-off events. For 10193442/10193776 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 378110 event pairs, 2562 based on Foata normal form. 206/38497 useless extension candidates. Maximal degree in co-relation 246805. Up to 13021 conditions per place. [2022-01-18 21:59:49,021 INFO L132 encePairwiseOnDemand]: 216/274 looper letters, 788 selfloop transitions, 763 changer transitions 9/1711 dead transitions. [2022-01-18 21:59:49,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1261 places, 1711 transitions, 25384 flow [2022-01-18 21:59:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-18 21:59:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-01-18 21:59:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 10581 transitions. [2022-01-18 21:59:49,027 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4950870297585626 [2022-01-18 21:59:49,027 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 10581 transitions. [2022-01-18 21:59:49,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 10581 transitions. [2022-01-18 21:59:49,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 21:59:49,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 10581 transitions. [2022-01-18 21:59:49,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 135.65384615384616) internal successors, (10581), 78 states have internal predecessors, (10581), 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) [2022-01-18 21:59:49,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 274.0) internal successors, (21646), 79 states have internal predecessors, (21646), 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) [2022-01-18 21:59:49,044 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 274.0) internal successors, (21646), 79 states have internal predecessors, (21646), 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) [2022-01-18 21:59:49,044 INFO L186 Difference]: Start difference. First operand has 1184 places, 1266 transitions, 14025 flow. Second operand 78 states and 10581 transitions. [2022-01-18 21:59:49,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1261 places, 1711 transitions, 25384 flow [2022-01-18 22:00:12,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1248 places, 1711 transitions, 23942 flow, removed 703 selfloop flow, removed 13 redundant places. [2022-01-18 22:00:12,727 INFO L242 Difference]: Finished difference. Result has 1283 places, 1390 transitions, 18163 flow [2022-01-18 22:00:12,729 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=12651, PETRI_DIFFERENCE_MINUEND_PLACES=1171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=657, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=18163, PETRI_PLACES=1283, PETRI_TRANSITIONS=1390} [2022-01-18 22:00:12,729 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1029 predicate places. [2022-01-18 22:00:12,729 INFO L470 AbstractCegarLoop]: Abstraction has has 1283 places, 1390 transitions, 18163 flow [2022-01-18 22:00:12,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 130.1764705882353) internal successors, (6639), 51 states have internal predecessors, (6639), 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) [2022-01-18 22:00:12,730 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:00:12,731 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:00:12,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-18 22:00:12,731 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 22:00:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:00:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1961893625, now seen corresponding path program 12 times [2022-01-18 22:00:12,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:00:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680610038] [2022-01-18 22:00:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:00:12,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:00:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:00:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:00:31,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:00:31,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680610038] [2022-01-18 22:00:31,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680610038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:00:31,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:00:31,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-18 22:00:31,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742179773] [2022-01-18 22:00:31,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:00:31,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-18 22:00:31,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:00:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-18 22:00:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 22:00:31,939 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-18 22:00:31,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1283 places, 1390 transitions, 18163 flow. Second operand has 48 states, 48 states have (on average 136.25) internal successors, (6540), 48 states have internal predecessors, (6540), 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) [2022-01-18 22:00:31,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:00:31,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-18 22:00:31,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:01:16,447 INFO L129 PetriNetUnfolder]: 18806/45103 cut-off events. [2022-01-18 22:01:16,447 INFO L130 PetriNetUnfolder]: For 14243187/14243595 co-relation queries the response was YES. [2022-01-18 22:01:20,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 307906 conditions, 45103 events. 18806/45103 cut-off events. For 14243187/14243595 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 451598 event pairs, 4004 based on Foata normal form. 238/44344 useless extension candidates. Maximal degree in co-relation 307508. Up to 19714 conditions per place. [2022-01-18 22:01:20,689 INFO L132 encePairwiseOnDemand]: 219/274 looper letters, 1296 selfloop transitions, 458 changer transitions 14/1926 dead transitions. [2022-01-18 22:01:20,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1356 places, 1926 transitions, 34658 flow [2022-01-18 22:01:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-18 22:01:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-18 22:01:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 10546 transitions. [2022-01-18 22:01:20,696 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.520122312093115 [2022-01-18 22:01:20,696 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 10546 transitions. [2022-01-18 22:01:20,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 10546 transitions. [2022-01-18 22:01:20,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:01:20,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 10546 transitions. [2022-01-18 22:01:20,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 142.51351351351352) internal successors, (10546), 74 states have internal predecessors, (10546), 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) [2022-01-18 22:01:20,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 274.0) internal successors, (20550), 75 states have internal predecessors, (20550), 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) [2022-01-18 22:01:20,716 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 274.0) internal successors, (20550), 75 states have internal predecessors, (20550), 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) [2022-01-18 22:01:20,716 INFO L186 Difference]: Start difference. First operand has 1283 places, 1390 transitions, 18163 flow. Second operand 74 states and 10546 transitions. [2022-01-18 22:01:20,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1356 places, 1926 transitions, 34658 flow [2022-01-18 22:01:54,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1305 places, 1926 transitions, 32172 flow, removed 1068 selfloop flow, removed 51 redundant places. [2022-01-18 22:01:54,395 INFO L242 Difference]: Finished difference. Result has 1341 places, 1572 transitions, 21888 flow [2022-01-18 22:01:54,397 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=16295, PETRI_DIFFERENCE_MINUEND_PLACES=1232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=21888, PETRI_PLACES=1341, PETRI_TRANSITIONS=1572} [2022-01-18 22:01:54,397 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1087 predicate places. [2022-01-18 22:01:54,397 INFO L470 AbstractCegarLoop]: Abstraction has has 1341 places, 1572 transitions, 21888 flow [2022-01-18 22:01:54,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 136.25) internal successors, (6540), 48 states have internal predecessors, (6540), 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) [2022-01-18 22:01:54,398 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:01:54,398 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:01:54,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-18 22:01:54,399 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 22:01:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:01:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1473864735, now seen corresponding path program 13 times [2022-01-18 22:01:54,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:01:54,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492792162] [2022-01-18 22:01:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:01:54,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:01:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:02:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:02:15,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:02:15,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492792162] [2022-01-18 22:02:15,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492792162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:02:15,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:02:15,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-18 22:02:15,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062734711] [2022-01-18 22:02:15,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:02:15,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-18 22:02:15,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:02:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-18 22:02:15,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-01-18 22:02:15,470 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-18 22:02:15,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1341 places, 1572 transitions, 21888 flow. Second operand has 47 states, 47 states have (on average 136.29787234042553) internal successors, (6406), 47 states have internal predecessors, (6406), 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) [2022-01-18 22:02:15,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:02:15,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-18 22:02:15,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:03:01,055 INFO L129 PetriNetUnfolder]: 20671/49172 cut-off events. [2022-01-18 22:03:01,056 INFO L130 PetriNetUnfolder]: For 13892670/13893442 co-relation queries the response was YES. [2022-01-18 22:03:05,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356624 conditions, 49172 events. 20671/49172 cut-off events. For 13892670/13893442 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 499445 event pairs, 3952 based on Foata normal form. 210/48248 useless extension candidates. Maximal degree in co-relation 356224. Up to 15906 conditions per place. [2022-01-18 22:03:06,115 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1173 selfloop transitions, 756 changer transitions 0/2087 dead transitions. [2022-01-18 22:03:06,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1416 places, 2087 transitions, 42646 flow [2022-01-18 22:03:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-18 22:03:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-01-18 22:03:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 10851 transitions. [2022-01-18 22:03:06,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5210814444871302 [2022-01-18 22:03:06,121 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 10851 transitions. [2022-01-18 22:03:06,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 10851 transitions. [2022-01-18 22:03:06,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:03:06,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 10851 transitions. [2022-01-18 22:03:06,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 142.77631578947367) internal successors, (10851), 76 states have internal predecessors, (10851), 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) [2022-01-18 22:03:06,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 274.0) internal successors, (21098), 77 states have internal predecessors, (21098), 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) [2022-01-18 22:03:06,137 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 274.0) internal successors, (21098), 77 states have internal predecessors, (21098), 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) [2022-01-18 22:03:06,137 INFO L186 Difference]: Start difference. First operand has 1341 places, 1572 transitions, 21888 flow. Second operand 76 states and 10851 transitions. [2022-01-18 22:03:06,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1416 places, 2087 transitions, 42646 flow [2022-01-18 22:03:37,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1394 places, 2087 transitions, 38751 flow, removed 1810 selfloop flow, removed 22 redundant places. [2022-01-18 22:03:37,109 INFO L242 Difference]: Finished difference. Result has 1423 places, 1697 transitions, 24974 flow [2022-01-18 22:03:37,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=19175, PETRI_DIFFERENCE_MINUEND_PLACES=1319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=664, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=24974, PETRI_PLACES=1423, PETRI_TRANSITIONS=1697} [2022-01-18 22:03:37,111 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1169 predicate places. [2022-01-18 22:03:37,111 INFO L470 AbstractCegarLoop]: Abstraction has has 1423 places, 1697 transitions, 24974 flow [2022-01-18 22:03:37,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 136.29787234042553) internal successors, (6406), 47 states have internal predecessors, (6406), 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) [2022-01-18 22:03:37,112 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:03:37,112 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:03:37,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-18 22:03:37,112 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-18 22:03:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:03:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1644941945, now seen corresponding path program 14 times [2022-01-18 22:03:37,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:03:37,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089318051] [2022-01-18 22:03:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:03:37,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:03:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-01-18 22:03:38,529 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-18 22:03:38,531 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-18 22:03:38,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-18 22:03:38,532 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 2ms.. [2022-01-18 22:03:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-18 22:03:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-18 22:03:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-18 22:03:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-01-18 22:03:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-18 22:03:38,534 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-18 22:03:38,537 INFO L732 BasicCegarLoop]: Path program histogram: [14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:03:38,540 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:03:38,540 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:03:38,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:03:38 BasicIcfg [2022-01-18 22:03:38,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:03:38,544 INFO L158 Benchmark]: Toolchain (without parser) took 724979.28ms. Allocated memory was 373.3MB in the beginning and 15.3GB in the end (delta: 14.9GB). Free memory was 319.1MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 6.8GB. Max. memory is 16.0GB. [2022-01-18 22:03:38,544 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 373.3MB. Free memory is still 337.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:03:38,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.41ms. Allocated memory is still 373.3MB. Free memory was 318.8MB in the beginning and 326.3MB in the end (delta: -7.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. [2022-01-18 22:03:38,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.06ms. Allocated memory is still 373.3MB. Free memory was 326.3MB in the beginning and 323.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:03:38,544 INFO L158 Benchmark]: Boogie Preprocessor took 28.72ms. Allocated memory is still 373.3MB. Free memory was 323.2MB in the beginning and 321.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:03:38,544 INFO L158 Benchmark]: RCFGBuilder took 508.79ms. Allocated memory is still 373.3MB. Free memory was 321.1MB in the beginning and 299.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2022-01-18 22:03:38,545 INFO L158 Benchmark]: TraceAbstraction took 723874.83ms. Allocated memory was 373.3MB in the beginning and 15.3GB in the end (delta: 14.9GB). Free memory was 299.0MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 6.8GB. Max. memory is 16.0GB. [2022-01-18 22:03:38,550 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.13ms. Allocated memory is still 373.3MB. Free memory is still 337.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 511.41ms. Allocated memory is still 373.3MB. Free memory was 318.8MB in the beginning and 326.3MB in the end (delta: -7.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.06ms. Allocated memory is still 373.3MB. Free memory was 326.3MB in the beginning and 323.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.72ms. Allocated memory is still 373.3MB. Free memory was 323.2MB in the beginning and 321.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 508.79ms. Allocated memory is still 373.3MB. Free memory was 321.1MB in the beginning and 299.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 723874.83ms. Allocated memory was 373.3MB in the beginning and 15.3GB in the end (delta: 14.9GB). Free memory was 299.0MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 6.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 2ms.. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 2ms.. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 2ms.. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 2ms.. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 26 for 2ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 723.6s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 544.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19627 SdHoareTripleChecker+Valid, 57.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19627 mSDsluCounter, 48784 SdHoareTripleChecker+Invalid, 50.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49914 mSDsCounter, 2380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85163 IncrementalHoareTripleChecker+Invalid, 87543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2380 mSolverCounterUnsat, 2906 mSDtfsCounter, 85163 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2580 GetRequests, 721 SyntacticMatches, 25 SemanticMatches, 1834 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51376 ImplicationChecksByTransitivity, 141.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24974occurred in iteration=27, InterpolantAutomatonStates: 1140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 176.6s InterpolantComputationTime, 4390 NumberOfCodeBlocks, 4390 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4363 ConstructedInterpolants, 0 QuantifiedInterpolants, 186660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 could not prove your program: Timeout Completed graceful shutdown