/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-Before.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-19 03:47:15,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 03:47:15,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 03:47:15,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 03:47:15,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 03:47:15,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 03:47:15,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 03:47:15,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 03:47:15,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 03:47:15,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 03:47:15,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 03:47:15,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 03:47:15,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 03:47:15,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 03:47:15,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 03:47:15,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 03:47:15,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 03:47:15,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 03:47:15,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 03:47:15,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 03:47:15,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 03:47:15,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 03:47:15,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 03:47:15,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 03:47:15,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 03:47:15,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 03:47:15,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 03:47:15,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 03:47:15,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 03:47:15,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 03:47:15,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 03:47:15,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 03:47:15,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 03:47:15,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 03:47:15,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 03:47:15,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 03:47:15,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 03:47:15,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 03:47:15,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 03:47:15,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 03:47:15,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 03:47:15,176 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-Before.epf [2022-01-19 03:47:15,195 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 03:47:15,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 03:47:15,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 03:47:15,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 03:47:15,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 03:47:15,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 03:47:15,197 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 03:47:15,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 03:47:15,197 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 03:47:15,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 03:47:15,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 03:47:15,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 03:47:15,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 03:47:15,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 03:47:15,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 03:47:15,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:47:15,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 03:47:15,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 03:47:15,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 03:47:15,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 03:47:15,201 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 03:47:15,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 03:47:15,201 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 03:47:15,201 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-19 03:47:15,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 03:47:15,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 03:47:15,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 03:47:15,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 03:47:15,411 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 03:47:15,412 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-19 03:47:15,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ae1570/87ff3f3a954b467cb1c93aa8fce0dfe8/FLAG2519adb68 [2022-01-19 03:47:15,920 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 03:47:15,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-01-19 03:47:15,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ae1570/87ff3f3a954b467cb1c93aa8fce0dfe8/FLAG2519adb68 [2022-01-19 03:47:15,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ae1570/87ff3f3a954b467cb1c93aa8fce0dfe8 [2022-01-19 03:47:15,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 03:47:15,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 03:47:15,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 03:47:15,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 03:47:15,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 03:47:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:47:15" (1/1) ... [2022-01-19 03:47:15,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5955448d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:15, skipping insertion in model container [2022-01-19 03:47:15,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:47:15" (1/1) ... [2022-01-19 03:47:15,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 03:47:16,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 03:47:16,354 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-19 03:47:16,360 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-19 03:47:16,364 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-19 03:47:16,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:47:16,377 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 03:47:16,426 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-19 03:47:16,428 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-19 03:47:16,433 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-19 03:47:16,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:47:16,487 INFO L208 MainTranslator]: Completed translation [2022-01-19 03:47:16,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16 WrapperNode [2022-01-19 03:47:16,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 03:47:16,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 03:47:16,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 03:47:16,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 03:47:16,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,549 INFO L137 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-01-19 03:47:16,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 03:47:16,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 03:47:16,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 03:47:16,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 03:47:16,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 03:47:16,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 03:47:16,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 03:47:16,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 03:47:16,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (1/1) ... [2022-01-19 03:47:16,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:47:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:47:16,633 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-19 03:47:16,642 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-19 03:47:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 03:47:16,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 03:47:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 03:47:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 03:47:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 03:47:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 03:47:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 03:47:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 03:47:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 03:47:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 03:47:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 03:47:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 03:47:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 03:47:16,664 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 03:47:16,742 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 03:47:16,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 03:47:17,025 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 03:47:17,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 03:47:17,031 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 03:47:17,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:47:17 BoogieIcfgContainer [2022-01-19 03:47:17,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 03:47:17,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 03:47:17,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 03:47:17,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 03:47:17,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:47:15" (1/3) ... [2022-01-19 03:47:17,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7608e0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:47:17, skipping insertion in model container [2022-01-19 03:47:17,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:47:16" (2/3) ... [2022-01-19 03:47:17,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7608e0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:47:17, skipping insertion in model container [2022-01-19 03:47:17,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:47:17" (3/3) ... [2022-01-19 03:47:17,037 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-01-19 03:47:17,040 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 03:47:17,040 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 03:47:17,041 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 03:47:17,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,093 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,099 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,099 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,105 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,105 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,138 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,138 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,141 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,146 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,153 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,153 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,153 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,154 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,155 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,155 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,155 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,155 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,155 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,156 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,157 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,157 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,157 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,158 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,159 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,160 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,161 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,162 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,163 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,164 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,165 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,166 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,167 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,168 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,169 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,169 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,169 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,169 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,170 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,171 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,172 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,172 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,172 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,173 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,173 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,173 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,173 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,173 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,173 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,174 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,175 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,175 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,175 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,175 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,176 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,177 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,177 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,180 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,180 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,180 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,181 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,181 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,181 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,181 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,185 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,201 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,202 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,203 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,203 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,203 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,203 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,204 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,205 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,206 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,207 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,208 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,208 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,208 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,209 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,210 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,211 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,214 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,215 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,221 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,222 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,223 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,227 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,228 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,228 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,228 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,228 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:47:17,231 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 03:47:17,265 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 03:47:17,269 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-19 03:47:17,269 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 03:47:17,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 266 places, 274 transitions, 564 flow [2022-01-19 03:47:17,338 INFO L129 PetriNetUnfolder]: 15/272 cut-off events. [2022-01-19 03:47:17,338 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:47:17,343 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-19 03:47:17,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 274 transitions, 564 flow [2022-01-19 03:47:17,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 262 transitions, 533 flow [2022-01-19 03:47:17,355 INFO L129 PetriNetUnfolder]: 2/66 cut-off events. [2022-01-19 03:47:17,355 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 03:47:17,355 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:17,356 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-19 03:47:17,356 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-19 03:47:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -266547570, now seen corresponding path program 1 times [2022-01-19 03:47:17,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:17,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082460793] [2022-01-19 03:47:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:17,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:17,541 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-19 03:47:17,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:17,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082460793] [2022-01-19 03:47:17,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082460793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:17,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:17,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 03:47:17,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525777718] [2022-01-19 03:47:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:17,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 03:47:17,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 03:47:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 03:47:17,580 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 274 [2022-01-19 03:47:17,583 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-19 03:47:17,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:17,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 274 [2022-01-19 03:47:17,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:17,631 INFO L129 PetriNetUnfolder]: 10/251 cut-off events. [2022-01-19 03:47:17,632 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-01-19 03:47:17,633 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-19 03:47:17,634 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 3 selfloop transitions, 0 changer transitions 0/251 dead transitions. [2022-01-19 03:47:17,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 251 transitions, 517 flow [2022-01-19 03:47:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 03:47:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 03:47:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 530 transitions. [2022-01-19 03:47:17,644 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9671532846715328 [2022-01-19 03:47:17,644 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 530 transitions. [2022-01-19 03:47:17,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 530 transitions. [2022-01-19 03:47:17,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:17,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 530 transitions. [2022-01-19 03:47:17,650 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-19 03:47:17,654 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-19 03:47:17,654 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-19 03:47:17,655 INFO L186 Difference]: Start difference. First operand has 254 places, 262 transitions, 533 flow. Second operand 2 states and 530 transitions. [2022-01-19 03:47:17,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 251 transitions, 517 flow [2022-01-19 03:47:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 512 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 03:47:17,661 INFO L242 Difference]: Finished difference. Result has 246 places, 251 transitions, 506 flow [2022-01-19 03:47:17,663 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-19 03:47:17,665 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-19 03:47:17,665 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 251 transitions, 506 flow [2022-01-19 03:47:17,665 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-19 03:47:17,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:17,665 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-19 03:47:17,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 03:47:17,665 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-19 03:47:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1627698218, now seen corresponding path program 1 times [2022-01-19 03:47:17,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:17,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212497024] [2022-01-19 03:47:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:17,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:17,845 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-19 03:47:17,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:17,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212497024] [2022-01-19 03:47:17,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212497024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:17,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:17,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 03:47:17,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095506070] [2022-01-19 03:47:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:17,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 03:47:17,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:17,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 03:47:17,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-19 03:47:17,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 274 [2022-01-19 03:47:17,851 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-19 03:47:17,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:17,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 274 [2022-01-19 03:47:17,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:18,595 INFO L129 PetriNetUnfolder]: 1003/4117 cut-off events. [2022-01-19 03:47:18,595 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-19 03:47:18,603 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-19 03:47:18,613 INFO L132 encePairwiseOnDemand]: 261/274 looper letters, 52 selfloop transitions, 12 changer transitions 0/247 dead transitions. [2022-01-19 03:47:18,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 247 transitions, 626 flow [2022-01-19 03:47:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 03:47:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 03:47:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2626 transitions. [2022-01-19 03:47:18,618 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7372262773722628 [2022-01-19 03:47:18,618 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2626 transitions. [2022-01-19 03:47:18,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2626 transitions. [2022-01-19 03:47:18,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:18,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2626 transitions. [2022-01-19 03:47:18,624 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-19 03:47:18,629 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-19 03:47:18,630 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-19 03:47:18,630 INFO L186 Difference]: Start difference. First operand has 246 places, 251 transitions, 506 flow. Second operand 13 states and 2626 transitions. [2022-01-19 03:47:18,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 247 transitions, 626 flow [2022-01-19 03:47:18,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 247 transitions, 626 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:47:18,637 INFO L242 Difference]: Finished difference. Result has 255 places, 247 transitions, 522 flow [2022-01-19 03:47:18,637 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-19 03:47:18,638 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1 predicate places. [2022-01-19 03:47:18,638 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 247 transitions, 522 flow [2022-01-19 03:47:18,639 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-19 03:47:18,639 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:18,639 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-19 03:47:18,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 03:47:18,640 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-19 03:47:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2013468752, now seen corresponding path program 1 times [2022-01-19 03:47:18,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158749466] [2022-01-19 03:47:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:18,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:18,722 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-19 03:47:18,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:18,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158749466] [2022-01-19 03:47:18,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158749466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:18,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:18,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 03:47:18,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41797966] [2022-01-19 03:47:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:18,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 03:47:18,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 03:47:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 03:47:18,725 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 274 [2022-01-19 03:47:18,726 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-19 03:47:18,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:18,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 274 [2022-01-19 03:47:18,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:18,791 INFO L129 PetriNetUnfolder]: 26/432 cut-off events. [2022-01-19 03:47:18,791 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 03:47:18,793 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-19 03:47:18,794 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 9 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2022-01-19 03:47:18,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 247 transitions, 554 flow [2022-01-19 03:47:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 03:47:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 03:47:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1015 transitions. [2022-01-19 03:47:18,796 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.926094890510949 [2022-01-19 03:47:18,796 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1015 transitions. [2022-01-19 03:47:18,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1015 transitions. [2022-01-19 03:47:18,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:18,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1015 transitions. [2022-01-19 03:47:18,798 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-19 03:47:18,800 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-19 03:47:18,800 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-19 03:47:18,800 INFO L186 Difference]: Start difference. First operand has 255 places, 247 transitions, 522 flow. Second operand 4 states and 1015 transitions. [2022-01-19 03:47:18,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 247 transitions, 554 flow [2022-01-19 03:47:18,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 247 transitions, 531 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-01-19 03:47:18,804 INFO L242 Difference]: Finished difference. Result has 246 places, 245 transitions, 505 flow [2022-01-19 03:47:18,805 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-19 03:47:18,806 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-19 03:47:18,806 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 245 transitions, 505 flow [2022-01-19 03:47:18,807 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-19 03:47:18,807 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:18,807 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-19 03:47:18,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 03:47:18,807 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-19 03:47:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1617079602, now seen corresponding path program 1 times [2022-01-19 03:47:18,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782760202] [2022-01-19 03:47:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:18,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:18,875 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-19 03:47:18,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:18,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782760202] [2022-01-19 03:47:18,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782760202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:18,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:18,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:47:18,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975846638] [2022-01-19 03:47:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:18,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:47:18,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:47:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:47:18,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 274 [2022-01-19 03:47:18,878 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-19 03:47:18,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:18,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 274 [2022-01-19 03:47:18,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:18,922 INFO L129 PetriNetUnfolder]: 33/527 cut-off events. [2022-01-19 03:47:18,922 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-01-19 03:47:18,924 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-19 03:47:18,925 INFO L132 encePairwiseOnDemand]: 270/274 looper letters, 10 selfloop transitions, 3 changer transitions 0/249 dead transitions. [2022-01-19 03:47:18,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 249 transitions, 542 flow [2022-01-19 03:47:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:47:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:47:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2022-01-19 03:47:18,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9476885644768857 [2022-01-19 03:47:18,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2022-01-19 03:47:18,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2022-01-19 03:47:18,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:18,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2022-01-19 03:47:18,928 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-19 03:47:18,930 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-19 03:47:18,930 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-19 03:47:18,930 INFO L186 Difference]: Start difference. First operand has 246 places, 245 transitions, 505 flow. Second operand 3 states and 779 transitions. [2022-01-19 03:47:18,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 249 transitions, 542 flow [2022-01-19 03:47:18,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 249 transitions, 532 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 03:47:18,933 INFO L242 Difference]: Finished difference. Result has 246 places, 246 transitions, 510 flow [2022-01-19 03:47:18,933 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-19 03:47:18,934 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-19 03:47:18,934 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 246 transitions, 510 flow [2022-01-19 03:47:18,934 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-19 03:47:18,934 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:18,934 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-19 03:47:18,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 03:47:18,935 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-19 03:47:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 771775214, now seen corresponding path program 1 times [2022-01-19 03:47:18,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:18,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534791672] [2022-01-19 03:47:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:18,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:18,974 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-19 03:47:18,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:18,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534791672] [2022-01-19 03:47:18,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534791672] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:18,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:18,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 03:47:18,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207018242] [2022-01-19 03:47:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:18,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 03:47:18,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:18,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 03:47:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 03:47:18,981 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 274 [2022-01-19 03:47:18,981 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-19 03:47:18,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:18,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 274 [2022-01-19 03:47:18,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:19,061 INFO L129 PetriNetUnfolder]: 51/836 cut-off events. [2022-01-19 03:47:19,061 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 03:47:19,064 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-19 03:47:19,066 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 15 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-01-19 03:47:19,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 573 flow [2022-01-19 03:47:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 03:47:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 03:47:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1281 transitions. [2022-01-19 03:47:19,068 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935036496350365 [2022-01-19 03:47:19,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1281 transitions. [2022-01-19 03:47:19,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1281 transitions. [2022-01-19 03:47:19,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:19,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1281 transitions. [2022-01-19 03:47:19,071 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-19 03:47:19,072 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-19 03:47:19,073 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-19 03:47:19,073 INFO L186 Difference]: Start difference. First operand has 246 places, 246 transitions, 510 flow. Second operand 5 states and 1281 transitions. [2022-01-19 03:47:19,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 573 flow [2022-01-19 03:47:19,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 254 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:47:19,076 INFO L242 Difference]: Finished difference. Result has 252 places, 249 transitions, 537 flow [2022-01-19 03:47:19,076 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-19 03:47:19,077 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -2 predicate places. [2022-01-19 03:47:19,077 INFO L470 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 537 flow [2022-01-19 03:47:19,077 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-19 03:47:19,077 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:19,077 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-19 03:47:19,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 03:47:19,078 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-19 03:47:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash -703749757, now seen corresponding path program 1 times [2022-01-19 03:47:19,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:19,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146323667] [2022-01-19 03:47:19,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:19,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:19,446 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-19 03:47:19,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:19,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146323667] [2022-01-19 03:47:19,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146323667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:19,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:19,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 03:47:19,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536840783] [2022-01-19 03:47:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:19,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 03:47:19,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 03:47:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-01-19 03:47:19,451 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 274 [2022-01-19 03:47:19,453 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-19 03:47:19,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:19,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 274 [2022-01-19 03:47:19,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:20,736 INFO L129 PetriNetUnfolder]: 1599/6669 cut-off events. [2022-01-19 03:47:20,736 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-01-19 03:47:20,812 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-19 03:47:20,830 INFO L132 encePairwiseOnDemand]: 258/274 looper letters, 79 selfloop transitions, 20 changer transitions 0/271 dead transitions. [2022-01-19 03:47:20,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 271 transitions, 781 flow [2022-01-19 03:47:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 03:47:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 03:47:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2876 transitions. [2022-01-19 03:47:20,835 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6997566909975669 [2022-01-19 03:47:20,835 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2876 transitions. [2022-01-19 03:47:20,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2876 transitions. [2022-01-19 03:47:20,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:20,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2876 transitions. [2022-01-19 03:47:20,841 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-19 03:47:20,846 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-19 03:47:20,846 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-19 03:47:20,846 INFO L186 Difference]: Start difference. First operand has 252 places, 249 transitions, 537 flow. Second operand 15 states and 2876 transitions. [2022-01-19 03:47:20,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 271 transitions, 781 flow [2022-01-19 03:47:20,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 271 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:47:20,851 INFO L242 Difference]: Finished difference. Result has 272 places, 262 transitions, 644 flow [2022-01-19 03:47:20,851 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-19 03:47:20,852 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 18 predicate places. [2022-01-19 03:47:20,852 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 262 transitions, 644 flow [2022-01-19 03:47:20,853 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-19 03:47:20,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:20,853 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-19 03:47:20,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 03:47:20,853 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-19 03:47:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash -940168002, now seen corresponding path program 1 times [2022-01-19 03:47:20,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:20,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447777751] [2022-01-19 03:47:20,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:20,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:21,679 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-19 03:47:21,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:21,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447777751] [2022-01-19 03:47:21,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447777751] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:21,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:21,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 03:47:21,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573456697] [2022-01-19 03:47:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:21,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 03:47:21,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 03:47:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-01-19 03:47:21,684 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 274 [2022-01-19 03:47:21,689 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-19 03:47:21,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:21,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 274 [2022-01-19 03:47:21,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:24,513 INFO L129 PetriNetUnfolder]: 1457/6029 cut-off events. [2022-01-19 03:47:24,513 INFO L130 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-01-19 03:47:24,546 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-19 03:47:24,564 INFO L132 encePairwiseOnDemand]: 243/274 looper letters, 88 selfloop transitions, 45 changer transitions 0/297 dead transitions. [2022-01-19 03:47:24,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 1004 flow [2022-01-19 03:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 03:47:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 03:47:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4778 transitions. [2022-01-19 03:47:24,574 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6458502297918356 [2022-01-19 03:47:24,574 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4778 transitions. [2022-01-19 03:47:24,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4778 transitions. [2022-01-19 03:47:24,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:24,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4778 transitions. [2022-01-19 03:47:24,584 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-19 03:47:24,592 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-19 03:47:24,593 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-19 03:47:24,593 INFO L186 Difference]: Start difference. First operand has 272 places, 262 transitions, 644 flow. Second operand 27 states and 4778 transitions. [2022-01-19 03:47:24,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 1004 flow [2022-01-19 03:47:24,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 297 transitions, 991 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 03:47:24,598 INFO L242 Difference]: Finished difference. Result has 303 places, 284 transitions, 870 flow [2022-01-19 03:47:24,598 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-19 03:47:24,599 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 49 predicate places. [2022-01-19 03:47:24,599 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 284 transitions, 870 flow [2022-01-19 03:47:24,600 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-19 03:47:24,600 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:24,601 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-19 03:47:24,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 03:47:24,601 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-19 03:47:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:24,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1623156073, now seen corresponding path program 1 times [2022-01-19 03:47:24,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:24,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529673718] [2022-01-19 03:47:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:24,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:25,202 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-19 03:47:25,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529673718] [2022-01-19 03:47:25,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529673718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:25,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:25,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 03:47:25,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881419170] [2022-01-19 03:47:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:25,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 03:47:25,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 03:47:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-19 03:47:25,206 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-19 03:47:25,208 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-19 03:47:25,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:25,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-19 03:47:25,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:26,744 INFO L129 PetriNetUnfolder]: 1619/6777 cut-off events. [2022-01-19 03:47:26,745 INFO L130 PetriNetUnfolder]: For 451/455 co-relation queries the response was YES. [2022-01-19 03:47:26,781 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-19 03:47:26,808 INFO L132 encePairwiseOnDemand]: 253/274 looper letters, 117 selfloop transitions, 34 changer transitions 0/320 dead transitions. [2022-01-19 03:47:26,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 1284 flow [2022-01-19 03:47:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 03:47:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 03:47:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2913 transitions. [2022-01-19 03:47:26,827 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6644616788321168 [2022-01-19 03:47:26,827 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2913 transitions. [2022-01-19 03:47:26,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2913 transitions. [2022-01-19 03:47:26,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:26,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2913 transitions. [2022-01-19 03:47:26,832 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-19 03:47:26,836 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-19 03:47:26,836 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-19 03:47:26,836 INFO L186 Difference]: Start difference. First operand has 303 places, 284 transitions, 870 flow. Second operand 16 states and 2913 transitions. [2022-01-19 03:47:26,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 1284 flow [2022-01-19 03:47:26,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 320 transitions, 1241 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-01-19 03:47:26,860 INFO L242 Difference]: Finished difference. Result has 311 places, 294 transitions, 994 flow [2022-01-19 03:47:26,861 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-19 03:47:26,862 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 57 predicate places. [2022-01-19 03:47:26,862 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 294 transitions, 994 flow [2022-01-19 03:47:26,863 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-19 03:47:26,863 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:26,863 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-19 03:47:26,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 03:47:26,864 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-19 03:47:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -156557425, now seen corresponding path program 2 times [2022-01-19 03:47:26,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:26,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269471461] [2022-01-19 03:47:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:26,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:27,443 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-19 03:47:27,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269471461] [2022-01-19 03:47:27,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269471461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:27,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:27,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 03:47:27,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274865397] [2022-01-19 03:47:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:27,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 03:47:27,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 03:47:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-01-19 03:47:27,446 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-19 03:47:27,448 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-19 03:47:27,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:27,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-19 03:47:27,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:29,421 INFO L129 PetriNetUnfolder]: 1640/6855 cut-off events. [2022-01-19 03:47:29,422 INFO L130 PetriNetUnfolder]: For 708/712 co-relation queries the response was YES. [2022-01-19 03:47:29,454 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-19 03:47:29,469 INFO L132 encePairwiseOnDemand]: 254/274 looper letters, 118 selfloop transitions, 38 changer transitions 0/325 dead transitions. [2022-01-19 03:47:29,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 325 transitions, 1427 flow [2022-01-19 03:47:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 03:47:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 03:47:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2737 transitions. [2022-01-19 03:47:29,473 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6659367396593674 [2022-01-19 03:47:29,473 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2737 transitions. [2022-01-19 03:47:29,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2737 transitions. [2022-01-19 03:47:29,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:29,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2737 transitions. [2022-01-19 03:47:29,477 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-19 03:47:29,480 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-19 03:47:29,481 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-19 03:47:29,481 INFO L186 Difference]: Start difference. First operand has 311 places, 294 transitions, 994 flow. Second operand 15 states and 2737 transitions. [2022-01-19 03:47:29,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 325 transitions, 1427 flow [2022-01-19 03:47:29,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 325 transitions, 1395 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-01-19 03:47:29,488 INFO L242 Difference]: Finished difference. Result has 319 places, 300 transitions, 1140 flow [2022-01-19 03:47:29,488 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-19 03:47:29,489 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 65 predicate places. [2022-01-19 03:47:29,489 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 300 transitions, 1140 flow [2022-01-19 03:47:29,490 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-19 03:47:29,490 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:29,490 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-19 03:47:29,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 03:47:29,490 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-19 03:47:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 655539223, now seen corresponding path program 3 times [2022-01-19 03:47:29,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:29,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607952735] [2022-01-19 03:47:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:29,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:29,888 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-19 03:47:29,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:29,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607952735] [2022-01-19 03:47:29,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607952735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:29,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:29,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 03:47:29,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73844873] [2022-01-19 03:47:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:29,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 03:47:29,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:29,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 03:47:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-19 03:47:29,891 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-19 03:47:29,892 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-19 03:47:29,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:29,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-19 03:47:29,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:31,077 INFO L129 PetriNetUnfolder]: 1625/6840 cut-off events. [2022-01-19 03:47:31,078 INFO L130 PetriNetUnfolder]: For 1146/1150 co-relation queries the response was YES. [2022-01-19 03:47:31,108 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-19 03:47:31,121 INFO L132 encePairwiseOnDemand]: 257/274 looper letters, 101 selfloop transitions, 36 changer transitions 0/306 dead transitions. [2022-01-19 03:47:31,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 306 transitions, 1422 flow [2022-01-19 03:47:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 03:47:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 03:47:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2535 transitions. [2022-01-19 03:47:31,124 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6608446298227321 [2022-01-19 03:47:31,124 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2535 transitions. [2022-01-19 03:47:31,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2535 transitions. [2022-01-19 03:47:31,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:31,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2535 transitions. [2022-01-19 03:47:31,127 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-19 03:47:31,130 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-19 03:47:31,130 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-19 03:47:31,130 INFO L186 Difference]: Start difference. First operand has 319 places, 300 transitions, 1140 flow. Second operand 14 states and 2535 transitions. [2022-01-19 03:47:31,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 306 transitions, 1422 flow [2022-01-19 03:47:31,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 306 transitions, 1386 flow, removed 4 selfloop flow, removed 11 redundant places. [2022-01-19 03:47:31,137 INFO L242 Difference]: Finished difference. Result has 319 places, 296 transitions, 1154 flow [2022-01-19 03:47:31,137 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-19 03:47:31,138 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 65 predicate places. [2022-01-19 03:47:31,138 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 296 transitions, 1154 flow [2022-01-19 03:47:31,139 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-19 03:47:31,139 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:31,139 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-19 03:47:31,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 03:47:31,139 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-19 03:47:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1000254974, now seen corresponding path program 1 times [2022-01-19 03:47:31,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:31,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138846294] [2022-01-19 03:47:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:31,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:32,296 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-19 03:47:32,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:32,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138846294] [2022-01-19 03:47:32,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138846294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:32,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:32,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-19 03:47:32,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506994531] [2022-01-19 03:47:32,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:32,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 03:47:32,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:32,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 03:47:32,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-01-19 03:47:32,300 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 274 [2022-01-19 03:47:32,302 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-19 03:47:32,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:32,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 274 [2022-01-19 03:47:32,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:34,852 INFO L129 PetriNetUnfolder]: 847/3524 cut-off events. [2022-01-19 03:47:34,852 INFO L130 PetriNetUnfolder]: For 1183/1186 co-relation queries the response was YES. [2022-01-19 03:47:34,864 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-19 03:47:34,871 INFO L132 encePairwiseOnDemand]: 245/274 looper letters, 121 selfloop transitions, 52 changer transitions 0/320 dead transitions. [2022-01-19 03:47:34,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 320 transitions, 1567 flow [2022-01-19 03:47:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 03:47:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 03:47:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4489 transitions. [2022-01-19 03:47:34,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6067856177345229 [2022-01-19 03:47:34,875 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4489 transitions. [2022-01-19 03:47:34,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4489 transitions. [2022-01-19 03:47:34,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:34,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4489 transitions. [2022-01-19 03:47:34,883 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-19 03:47:34,888 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-19 03:47:34,888 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-19 03:47:34,888 INFO L186 Difference]: Start difference. First operand has 319 places, 296 transitions, 1154 flow. Second operand 27 states and 4489 transitions. [2022-01-19 03:47:34,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 320 transitions, 1567 flow [2022-01-19 03:47:34,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 1475 flow, removed 1 selfloop flow, removed 21 redundant places. [2022-01-19 03:47:34,895 INFO L242 Difference]: Finished difference. Result has 318 places, 287 transitions, 1154 flow [2022-01-19 03:47:34,895 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-19 03:47:34,896 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 64 predicate places. [2022-01-19 03:47:34,896 INFO L470 AbstractCegarLoop]: Abstraction has has 318 places, 287 transitions, 1154 flow [2022-01-19 03:47:34,897 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-19 03:47:34,897 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:34,897 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-19 03:47:34,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 03:47:34,897 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-19 03:47:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1409670591, now seen corresponding path program 1 times [2022-01-19 03:47:34,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:34,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037956942] [2022-01-19 03:47:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:34,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:34,933 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-19 03:47:34,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:34,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037956942] [2022-01-19 03:47:34,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037956942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:34,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:34,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:47:34,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534418025] [2022-01-19 03:47:34,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:34,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:47:34,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:47:34,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:47:34,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 274 [2022-01-19 03:47:34,935 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-19 03:47:34,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:34,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 274 [2022-01-19 03:47:34,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:35,015 INFO L129 PetriNetUnfolder]: 62/911 cut-off events. [2022-01-19 03:47:35,016 INFO L130 PetriNetUnfolder]: For 544/545 co-relation queries the response was YES. [2022-01-19 03:47:35,018 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-19 03:47:35,019 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 12 selfloop transitions, 6 changer transitions 0/289 dead transitions. [2022-01-19 03:47:35,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 289 transitions, 1197 flow [2022-01-19 03:47:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:47:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:47:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2022-01-19 03:47:35,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9306569343065694 [2022-01-19 03:47:35,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2022-01-19 03:47:35,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2022-01-19 03:47:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:35,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2022-01-19 03:47:35,022 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-19 03:47:35,023 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-19 03:47:35,023 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-19 03:47:35,023 INFO L186 Difference]: Start difference. First operand has 318 places, 287 transitions, 1154 flow. Second operand 3 states and 765 transitions. [2022-01-19 03:47:35,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 289 transitions, 1197 flow [2022-01-19 03:47:35,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 1103 flow, removed 2 selfloop flow, removed 23 redundant places. [2022-01-19 03:47:35,029 INFO L242 Difference]: Finished difference. Result has 297 places, 287 transitions, 1072 flow [2022-01-19 03:47:35,030 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-19 03:47:35,030 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 43 predicate places. [2022-01-19 03:47:35,030 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 287 transitions, 1072 flow [2022-01-19 03:47:35,030 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-19 03:47:35,031 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:35,031 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-19 03:47:35,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 03:47:35,031 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-19 03:47:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -849021323, now seen corresponding path program 1 times [2022-01-19 03:47:35,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:35,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257120760] [2022-01-19 03:47:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:35,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:35,726 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-19 03:47:35,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:35,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257120760] [2022-01-19 03:47:35,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257120760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:35,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:35,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-19 03:47:35,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31721406] [2022-01-19 03:47:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:35,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 03:47:35,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 03:47:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-01-19 03:47:35,729 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 274 [2022-01-19 03:47:35,731 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-19 03:47:35,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:35,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 274 [2022-01-19 03:47:35,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:37,350 INFO L129 PetriNetUnfolder]: 393/1832 cut-off events. [2022-01-19 03:47:37,350 INFO L130 PetriNetUnfolder]: For 1081/1085 co-relation queries the response was YES. [2022-01-19 03:47:37,356 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-19 03:47:37,359 INFO L132 encePairwiseOnDemand]: 243/274 looper letters, 141 selfloop transitions, 56 changer transitions 0/342 dead transitions. [2022-01-19 03:47:37,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 342 transitions, 1639 flow [2022-01-19 03:47:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 03:47:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 03:47:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4780 transitions. [2022-01-19 03:47:37,363 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6230448383733055 [2022-01-19 03:47:37,363 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4780 transitions. [2022-01-19 03:47:37,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4780 transitions. [2022-01-19 03:47:37,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:37,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4780 transitions. [2022-01-19 03:47:37,367 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-19 03:47:37,372 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-19 03:47:37,372 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-19 03:47:37,372 INFO L186 Difference]: Start difference. First operand has 297 places, 287 transitions, 1072 flow. Second operand 28 states and 4780 transitions. [2022-01-19 03:47:37,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 342 transitions, 1639 flow [2022-01-19 03:47:37,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 342 transitions, 1633 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:47:37,379 INFO L242 Difference]: Finished difference. Result has 328 places, 294 transitions, 1223 flow [2022-01-19 03:47:37,380 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-19 03:47:37,380 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 74 predicate places. [2022-01-19 03:47:37,380 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 294 transitions, 1223 flow [2022-01-19 03:47:37,381 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-19 03:47:37,381 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:37,381 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-19 03:47:37,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 03:47:37,381 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-19 03:47:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 390492704, now seen corresponding path program 1 times [2022-01-19 03:47:37,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:37,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406770805] [2022-01-19 03:47:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:37,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:47:39,122 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-19 03:47:39,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:47:39,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406770805] [2022-01-19 03:47:39,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406770805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:47:39,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:47:39,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-19 03:47:39,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671005936] [2022-01-19 03:47:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:47:39,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-19 03:47:39,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:47:39,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-19 03:47:39,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2022-01-19 03:47:39,127 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 274 [2022-01-19 03:47:39,131 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-19 03:47:39,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:47:39,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 274 [2022-01-19 03:47:39,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:47:42,618 INFO L129 PetriNetUnfolder]: 539/2370 cut-off events. [2022-01-19 03:47:42,618 INFO L130 PetriNetUnfolder]: For 1650/1654 co-relation queries the response was YES. [2022-01-19 03:47:42,626 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-19 03:47:42,630 INFO L132 encePairwiseOnDemand]: 234/274 looper letters, 184 selfloop transitions, 66 changer transitions 0/386 dead transitions. [2022-01-19 03:47:42,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 386 transitions, 2006 flow [2022-01-19 03:47:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-19 03:47:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-01-19 03:47:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5564 transitions. [2022-01-19 03:47:42,659 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5801876955161627 [2022-01-19 03:47:42,659 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 5564 transitions. [2022-01-19 03:47:42,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 5564 transitions. [2022-01-19 03:47:42,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:47:42,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5564 transitions. [2022-01-19 03:47:42,664 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-19 03:47:42,672 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-19 03:47:42,673 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-19 03:47:42,673 INFO L186 Difference]: Start difference. First operand has 328 places, 294 transitions, 1223 flow. Second operand 35 states and 5564 transitions. [2022-01-19 03:47:42,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 386 transitions, 2006 flow [2022-01-19 03:47:42,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 386 transitions, 1910 flow, removed 0 selfloop flow, removed 21 redundant places. [2022-01-19 03:47:42,684 INFO L242 Difference]: Finished difference. Result has 351 places, 309 transitions, 1373 flow [2022-01-19 03:47:42,684 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-19 03:47:42,684 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 97 predicate places. [2022-01-19 03:47:42,685 INFO L470 AbstractCegarLoop]: Abstraction has has 351 places, 309 transitions, 1373 flow [2022-01-19 03:47:42,685 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-19 03:47:42,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:47:42,685 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-19 03:47:42,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 03:47:42,686 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-19 03:47:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:47:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash 538588479, now seen corresponding path program 1 times [2022-01-19 03:47:42,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:47:42,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098074241] [2022-01-19 03:47:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:47:42,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:47:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:48:03,614 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-19 03:48:03,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:48:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098074241] [2022-01-19 03:48:03,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098074241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:48:03,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:48:03,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 03:48:03,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611034524] [2022-01-19 03:48:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:48:03,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 03:48:03,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:48:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 03:48:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 03:48:03,619 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:48:03,622 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-19 03:48:03,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:48:03,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:48:03,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:48:18,386 INFO L129 PetriNetUnfolder]: 5938/14612 cut-off events. [2022-01-19 03:48:18,387 INFO L130 PetriNetUnfolder]: For 7358/7359 co-relation queries the response was YES. [2022-01-19 03:48:18,436 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-19 03:48:18,458 INFO L132 encePairwiseOnDemand]: 215/274 looper letters, 561 selfloop transitions, 165 changer transitions 57/903 dead transitions. [2022-01-19 03:48:18,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 903 transitions, 4669 flow [2022-01-19 03:48:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-19 03:48:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-01-19 03:48:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 10699 transitions. [2022-01-19 03:48:18,465 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5137821744141375 [2022-01-19 03:48:18,465 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 10699 transitions. [2022-01-19 03:48:18,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 10699 transitions. [2022-01-19 03:48:18,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:48:18,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 10699 transitions. [2022-01-19 03:48:18,475 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-19 03:48:18,485 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-19 03:48:18,486 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-19 03:48:18,486 INFO L186 Difference]: Start difference. First operand has 351 places, 309 transitions, 1373 flow. Second operand 76 states and 10699 transitions. [2022-01-19 03:48:18,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 903 transitions, 4669 flow [2022-01-19 03:48:18,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 903 transitions, 4520 flow, removed 15 selfloop flow, removed 22 redundant places. [2022-01-19 03:48:18,520 INFO L242 Difference]: Finished difference. Result has 456 places, 420 transitions, 2514 flow [2022-01-19 03:48:18,520 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-19 03:48:18,521 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 202 predicate places. [2022-01-19 03:48:18,521 INFO L470 AbstractCegarLoop]: Abstraction has has 456 places, 420 transitions, 2514 flow [2022-01-19 03:48:18,522 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-19 03:48:18,522 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:48:18,522 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-19 03:48:18,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 03:48:18,522 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-19 03:48:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:48:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1559785829, now seen corresponding path program 2 times [2022-01-19 03:48:18,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:48:18,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457462428] [2022-01-19 03:48:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:48:18,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:48:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:48:21,078 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-19 03:48:21,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:48:21,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457462428] [2022-01-19 03:48:21,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457462428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:48:21,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:48:21,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:48:21,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976697013] [2022-01-19 03:48:21,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:48:21,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:48:21,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:48:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:48:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:48:21,082 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:48:21,085 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-19 03:48:21,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:48:21,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:48:21,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:48:34,869 INFO L129 PetriNetUnfolder]: 7561/18001 cut-off events. [2022-01-19 03:48:34,870 INFO L130 PetriNetUnfolder]: For 151418/151495 co-relation queries the response was YES. [2022-01-19 03:48:35,054 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-19 03:48:35,100 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 534 selfloop transitions, 134 changer transitions 45/833 dead transitions. [2022-01-19 03:48:35,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 833 transitions, 6691 flow [2022-01-19 03:48:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-19 03:48:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-19 03:48:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10122 transitions. [2022-01-19 03:48:35,162 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.506049395060494 [2022-01-19 03:48:35,162 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10122 transitions. [2022-01-19 03:48:35,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10122 transitions. [2022-01-19 03:48:35,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:48:35,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10122 transitions. [2022-01-19 03:48:35,172 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-19 03:48:35,185 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-19 03:48:35,186 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-19 03:48:35,187 INFO L186 Difference]: Start difference. First operand has 456 places, 420 transitions, 2514 flow. Second operand 73 states and 10122 transitions. [2022-01-19 03:48:35,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 833 transitions, 6691 flow [2022-01-19 03:48:35,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 833 transitions, 6568 flow, removed 19 selfloop flow, removed 17 redundant places. [2022-01-19 03:48:35,516 INFO L242 Difference]: Finished difference. Result has 547 places, 544 transitions, 4430 flow [2022-01-19 03:48:35,517 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-19 03:48:35,518 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 293 predicate places. [2022-01-19 03:48:35,518 INFO L470 AbstractCegarLoop]: Abstraction has has 547 places, 544 transitions, 4430 flow [2022-01-19 03:48:35,519 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-19 03:48:35,519 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:48:35,519 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-19 03:48:35,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 03:48:35,519 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-19 03:48:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:48:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2136658691, now seen corresponding path program 3 times [2022-01-19 03:48:35,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:48:35,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720615228] [2022-01-19 03:48:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:48:35,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:48:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:48:54,919 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-19 03:48:54,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:48:54,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720615228] [2022-01-19 03:48:54,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720615228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:48:54,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:48:54,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:48:54,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435052084] [2022-01-19 03:48:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:48:54,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:48:54,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:48:54,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:48:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1982, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:48:54,927 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 03:48:54,930 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-19 03:48:54,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:48:54,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 03:48:54,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:49:09,814 INFO L129 PetriNetUnfolder]: 8188/20063 cut-off events. [2022-01-19 03:49:09,814 INFO L130 PetriNetUnfolder]: For 545578/545707 co-relation queries the response was YES. [2022-01-19 03:49:10,002 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-19 03:49:10,051 INFO L132 encePairwiseOnDemand]: 221/274 looper letters, 624 selfloop transitions, 135 changer transitions 6/897 dead transitions. [2022-01-19 03:49:10,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 897 transitions, 9013 flow [2022-01-19 03:49:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-19 03:49:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-19 03:49:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 9204 transitions. [2022-01-19 03:49:10,073 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5167883211678832 [2022-01-19 03:49:10,073 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 9204 transitions. [2022-01-19 03:49:10,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 9204 transitions. [2022-01-19 03:49:10,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:49:10,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 9204 transitions. [2022-01-19 03:49:10,082 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-19 03:49:10,092 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-19 03:49:10,093 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-19 03:49:10,094 INFO L186 Difference]: Start difference. First operand has 547 places, 544 transitions, 4430 flow. Second operand 65 states and 9204 transitions. [2022-01-19 03:49:10,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 897 transitions, 9013 flow [2022-01-19 03:49:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 897 transitions, 8102 flow, removed 441 selfloop flow, removed 12 redundant places. [2022-01-19 03:49:11,361 INFO L242 Difference]: Finished difference. Result has 627 places, 624 transitions, 5191 flow [2022-01-19 03:49:11,362 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-19 03:49:11,362 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 373 predicate places. [2022-01-19 03:49:11,362 INFO L470 AbstractCegarLoop]: Abstraction has has 627 places, 624 transitions, 5191 flow [2022-01-19 03:49:11,363 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-19 03:49:11,363 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:49:11,363 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-19 03:49:11,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 03:49:11,364 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-19 03:49:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:49:11,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1185275489, now seen corresponding path program 4 times [2022-01-19 03:49:11,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:49:11,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695866568] [2022-01-19 03:49:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:49:11,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:49:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:49:29,550 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-19 03:49:29,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:49:29,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695866568] [2022-01-19 03:49:29,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695866568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:49:29,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:49:29,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-01-19 03:49:29,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843744704] [2022-01-19 03:49:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:49:29,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 03:49:29,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:49:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 03:49:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1889, Unknown=0, NotChecked=0, Total=2070 [2022-01-19 03:49:29,554 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 03:49:29,557 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-19 03:49:29,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:49:29,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 03:49:29,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:49:44,868 INFO L129 PetriNetUnfolder]: 9243/22646 cut-off events. [2022-01-19 03:49:44,869 INFO L130 PetriNetUnfolder]: For 1086912/1087089 co-relation queries the response was YES. [2022-01-19 03:49:45,179 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-19 03:49:45,247 INFO L132 encePairwiseOnDemand]: 221/274 looper letters, 694 selfloop transitions, 112 changer transitions 2/940 dead transitions. [2022-01-19 03:49:45,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 940 transitions, 9379 flow [2022-01-19 03:49:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 03:49:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 03:49:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 8364 transitions. [2022-01-19 03:49:45,253 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5173821600890759 [2022-01-19 03:49:45,253 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 8364 transitions. [2022-01-19 03:49:45,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 8364 transitions. [2022-01-19 03:49:45,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:49:45,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 8364 transitions. [2022-01-19 03:49:45,261 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-19 03:49:45,268 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-19 03:49:45,269 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-19 03:49:45,269 INFO L186 Difference]: Start difference. First operand has 627 places, 624 transitions, 5191 flow. Second operand 59 states and 8364 transitions. [2022-01-19 03:49:45,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 940 transitions, 9379 flow [2022-01-19 03:49:47,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 940 transitions, 8779 flow, removed 242 selfloop flow, removed 20 redundant places. [2022-01-19 03:49:47,205 INFO L242 Difference]: Finished difference. Result has 694 places, 696 transitions, 6156 flow [2022-01-19 03:49:47,205 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-19 03:49:47,205 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 440 predicate places. [2022-01-19 03:49:47,206 INFO L470 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 6156 flow [2022-01-19 03:49:47,206 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-19 03:49:47,206 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:49:47,206 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-19 03:49:47,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 03:49:47,207 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-19 03:49:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:49:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1266799135, now seen corresponding path program 5 times [2022-01-19 03:49:47,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:49:47,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125380738] [2022-01-19 03:49:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:49:47,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:49:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:49:49,904 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-19 03:49:49,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:49:49,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125380738] [2022-01-19 03:49:49,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125380738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:49:49,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:49:49,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:49:49,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326269961] [2022-01-19 03:49:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:49:49,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:49:49,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:49:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:49:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1995, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:49:49,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:49:49,910 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-19 03:49:49,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:49:49,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:49:49,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:50:09,878 INFO L129 PetriNetUnfolder]: 10916/25839 cut-off events. [2022-01-19 03:50:09,879 INFO L130 PetriNetUnfolder]: For 2312903/2313058 co-relation queries the response was YES. [2022-01-19 03:50:10,253 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-19 03:50:10,319 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 805 selfloop transitions, 151 changer transitions 7/1083 dead transitions. [2022-01-19 03:50:10,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 1083 transitions, 11766 flow [2022-01-19 03:50:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-19 03:50:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-19 03:50:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10092 transitions. [2022-01-19 03:50:10,324 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5045495450454954 [2022-01-19 03:50:10,324 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10092 transitions. [2022-01-19 03:50:10,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10092 transitions. [2022-01-19 03:50:10,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:50:10,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10092 transitions. [2022-01-19 03:50:10,331 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-19 03:50:10,340 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-19 03:50:10,341 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-19 03:50:10,341 INFO L186 Difference]: Start difference. First operand has 694 places, 696 transitions, 6156 flow. Second operand 73 states and 10092 transitions. [2022-01-19 03:50:10,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 1083 transitions, 11766 flow [2022-01-19 03:50:13,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 1083 transitions, 11189 flow, removed 271 selfloop flow, removed 14 redundant places. [2022-01-19 03:50:13,473 INFO L242 Difference]: Finished difference. Result has 784 places, 804 transitions, 7788 flow [2022-01-19 03:50:13,473 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-19 03:50:13,473 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 530 predicate places. [2022-01-19 03:50:13,473 INFO L470 AbstractCegarLoop]: Abstraction has has 784 places, 804 transitions, 7788 flow [2022-01-19 03:50:13,474 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-19 03:50:13,474 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:50:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:50:13,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 03:50:13,475 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-19 03:50:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:50:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1722317643, now seen corresponding path program 6 times [2022-01-19 03:50:13,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:50:13,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533166115] [2022-01-19 03:50:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:50:13,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:50:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:50:15,775 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-19 03:50:15,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:50:15,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533166115] [2022-01-19 03:50:15,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533166115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:50:15,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:50:15,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:50:15,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160892544] [2022-01-19 03:50:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:50:15,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:50:15,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:50:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:50:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:50:15,780 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:50:15,787 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-19 03:50:15,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:50:15,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:50:15,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:50:38,460 INFO L129 PetriNetUnfolder]: 11965/28276 cut-off events. [2022-01-19 03:50:38,460 INFO L130 PetriNetUnfolder]: For 3523044/3523221 co-relation queries the response was YES. [2022-01-19 03:50:39,047 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-19 03:50:39,134 INFO L132 encePairwiseOnDemand]: 216/274 looper letters, 870 selfloop transitions, 212 changer transitions 11/1213 dead transitions. [2022-01-19 03:50:39,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 1213 transitions, 15256 flow [2022-01-19 03:50:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-19 03:50:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-01-19 03:50:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 10394 transitions. [2022-01-19 03:50:39,141 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5057907542579075 [2022-01-19 03:50:39,141 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 10394 transitions. [2022-01-19 03:50:39,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 10394 transitions. [2022-01-19 03:50:39,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:50:39,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 10394 transitions. [2022-01-19 03:50:39,150 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-19 03:50:39,159 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-19 03:50:39,160 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-19 03:50:39,160 INFO L186 Difference]: Start difference. First operand has 784 places, 804 transitions, 7788 flow. Second operand 75 states and 10394 transitions. [2022-01-19 03:50:39,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 1213 transitions, 15256 flow [2022-01-19 03:50:44,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 1213 transitions, 14278 flow, removed 465 selfloop flow, removed 14 redundant places. [2022-01-19 03:50:44,305 INFO L242 Difference]: Finished difference. Result has 875 places, 908 transitions, 9357 flow [2022-01-19 03:50:44,306 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-19 03:50:44,306 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 621 predicate places. [2022-01-19 03:50:44,306 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 908 transitions, 9357 flow [2022-01-19 03:50:44,307 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-19 03:50:44,307 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:50:44,307 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-19 03:50:44,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 03:50:44,307 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-19 03:50:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:50:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash 237417657, now seen corresponding path program 7 times [2022-01-19 03:50:44,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:50:44,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626753959] [2022-01-19 03:50:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:50:44,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:50:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:50:46,877 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-19 03:50:46,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:50:46,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626753959] [2022-01-19 03:50:46,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626753959] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:50:46,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:50:46,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:50:46,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067285009] [2022-01-19 03:50:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:50:46,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:50:46,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:50:46,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:50:46,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1992, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:50:46,881 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:50:46,883 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-19 03:50:46,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:50:46,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:50:46,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:51:10,964 INFO L129 PetriNetUnfolder]: 13049/30808 cut-off events. [2022-01-19 03:51:10,966 INFO L130 PetriNetUnfolder]: For 5126873/5127148 co-relation queries the response was YES. [2022-01-19 03:51:12,606 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-19 03:51:12,691 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 972 selfloop transitions, 204 changer transitions 9/1305 dead transitions. [2022-01-19 03:51:12,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1305 transitions, 17067 flow [2022-01-19 03:51:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 03:51:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 03:51:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 10251 transitions. [2022-01-19 03:51:12,696 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5055730913395147 [2022-01-19 03:51:12,696 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 10251 transitions. [2022-01-19 03:51:12,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 10251 transitions. [2022-01-19 03:51:12,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:51:12,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 10251 transitions. [2022-01-19 03:51:12,703 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-19 03:51:12,711 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-19 03:51:12,712 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-19 03:51:12,712 INFO L186 Difference]: Start difference. First operand has 875 places, 908 transitions, 9357 flow. Second operand 74 states and 10251 transitions. [2022-01-19 03:51:12,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1305 transitions, 17067 flow [2022-01-19 03:51:21,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 1305 transitions, 15685 flow, removed 596 selfloop flow, removed 19 redundant places. [2022-01-19 03:51:21,737 INFO L242 Difference]: Finished difference. Result has 960 places, 1008 transitions, 10659 flow [2022-01-19 03:51:21,738 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-19 03:51:21,738 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 706 predicate places. [2022-01-19 03:51:21,738 INFO L470 AbstractCegarLoop]: Abstraction has has 960 places, 1008 transitions, 10659 flow [2022-01-19 03:51:21,739 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-19 03:51:21,739 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:51:21,755 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-19 03:51:21,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 03:51:21,755 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-19 03:51:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:51:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 802123773, now seen corresponding path program 8 times [2022-01-19 03:51:21,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:51:21,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283793037] [2022-01-19 03:51:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:51:21,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:51:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:51:24,283 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-19 03:51:24,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:51:24,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283793037] [2022-01-19 03:51:24,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283793037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:51:24,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:51:24,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:51:24,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650972343] [2022-01-19 03:51:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:51:24,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:51:24,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:51:24,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:51:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:51:24,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:51:24,289 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-19 03:51:24,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:51:24,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:51:24,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:51:50,806 INFO L129 PetriNetUnfolder]: 14065/33158 cut-off events. [2022-01-19 03:51:50,806 INFO L130 PetriNetUnfolder]: For 6611060/6611405 co-relation queries the response was YES. [2022-01-19 03:51:52,108 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-19 03:51:52,206 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 1049 selfloop transitions, 239 changer transitions 13/1421 dead transitions. [2022-01-19 03:51:52,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 1421 transitions, 20267 flow [2022-01-19 03:51:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-19 03:51:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-01-19 03:51:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 10671 transitions. [2022-01-19 03:51:52,228 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5057825386292539 [2022-01-19 03:51:52,228 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 10671 transitions. [2022-01-19 03:51:52,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 10671 transitions. [2022-01-19 03:51:52,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:51:52,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 10671 transitions. [2022-01-19 03:51:52,235 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-19 03:51:52,244 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-19 03:51:52,245 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-19 03:51:52,245 INFO L186 Difference]: Start difference. First operand has 960 places, 1008 transitions, 10659 flow. Second operand 77 states and 10671 transitions. [2022-01-19 03:51:52,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1036 places, 1421 transitions, 20267 flow [2022-01-19 03:52:02,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1421 transitions, 18771 flow, removed 681 selfloop flow, removed 18 redundant places. [2022-01-19 03:52:02,978 INFO L242 Difference]: Finished difference. Result has 1046 places, 1105 transitions, 12033 flow [2022-01-19 03:52:02,979 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-19 03:52:02,979 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 792 predicate places. [2022-01-19 03:52:02,979 INFO L470 AbstractCegarLoop]: Abstraction has has 1046 places, 1105 transitions, 12033 flow [2022-01-19 03:52:02,980 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-19 03:52:02,980 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:52:02,980 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-19 03:52:02,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 03:52:02,980 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-19 03:52:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:52:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 182655999, now seen corresponding path program 9 times [2022-01-19 03:52:02,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:52:02,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108528732] [2022-01-19 03:52:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:52:02,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:52:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:52:05,207 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-19 03:52:05,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:52:05,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108528732] [2022-01-19 03:52:05,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108528732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:52:05,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:52:05,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 03:52:05,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908401792] [2022-01-19 03:52:05,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:52:05,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 03:52:05,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:52:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 03:52:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 03:52:05,214 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2022-01-19 03:52:05,216 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-19 03:52:05,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:52:05,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2022-01-19 03:52:05,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:52:32,197 INFO L129 PetriNetUnfolder]: 14881/35239 cut-off events. [2022-01-19 03:52:32,198 INFO L130 PetriNetUnfolder]: For 8370912/8371342 co-relation queries the response was YES. [2022-01-19 03:52:33,461 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-19 03:52:33,566 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1078 selfloop transitions, 263 changer transitions 20/1508 dead transitions. [2022-01-19 03:52:33,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1115 places, 1508 transitions, 22334 flow [2022-01-19 03:52:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-19 03:52:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-01-19 03:52:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 9548 transitions. [2022-01-19 03:52:33,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4978102189781022 [2022-01-19 03:52:33,571 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 9548 transitions. [2022-01-19 03:52:33,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 9548 transitions. [2022-01-19 03:52:33,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:52:33,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 9548 transitions. [2022-01-19 03:52:33,577 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-19 03:52:33,585 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-19 03:52:33,585 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-19 03:52:33,585 INFO L186 Difference]: Start difference. First operand has 1046 places, 1105 transitions, 12033 flow. Second operand 70 states and 9548 transitions. [2022-01-19 03:52:33,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1115 places, 1508 transitions, 22334 flow [2022-01-19 03:52:51,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1092 places, 1508 transitions, 20574 flow, removed 750 selfloop flow, removed 23 redundant places. [2022-01-19 03:52:51,109 INFO L242 Difference]: Finished difference. Result has 1116 places, 1187 transitions, 13014 flow [2022-01-19 03:52:51,110 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-19 03:52:51,110 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 862 predicate places. [2022-01-19 03:52:51,110 INFO L470 AbstractCegarLoop]: Abstraction has has 1116 places, 1187 transitions, 13014 flow [2022-01-19 03:52:51,111 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-19 03:52:51,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:52:51,111 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-19 03:52:51,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 03:52:51,111 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-19 03:52:51,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:52:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1265422235, now seen corresponding path program 10 times [2022-01-19 03:52:51,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:52:51,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226508325] [2022-01-19 03:52:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:52:51,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:52:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:09,261 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-19 03:53:09,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:09,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226508325] [2022-01-19 03:53:09,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226508325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:53:09,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:53:09,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 03:53:09,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133955200] [2022-01-19 03:53:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:53:09,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 03:53:09,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 03:53:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 03:53:09,265 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 03:53:09,267 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-19 03:53:09,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:09,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 03:53:09,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:39,426 INFO L129 PetriNetUnfolder]: 15696/37021 cut-off events. [2022-01-19 03:53:39,426 INFO L130 PetriNetUnfolder]: For 8648233/8648598 co-relation queries the response was YES. [2022-01-19 03:53:40,727 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-19 03:53:40,841 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1272 selfloop transitions, 138 changer transitions 3/1534 dead transitions. [2022-01-19 03:53:40,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1178 places, 1534 transitions, 21053 flow [2022-01-19 03:53:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-19 03:53:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-19 03:53:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 8744 transitions. [2022-01-19 03:53:40,846 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5065461707797474 [2022-01-19 03:53:40,846 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 8744 transitions. [2022-01-19 03:53:40,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 8744 transitions. [2022-01-19 03:53:40,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:40,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 8744 transitions. [2022-01-19 03:53:40,852 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-19 03:53:40,859 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-19 03:53:40,859 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-19 03:53:40,859 INFO L186 Difference]: Start difference. First operand has 1116 places, 1187 transitions, 13014 flow. Second operand 63 states and 8744 transitions. [2022-01-19 03:53:40,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1178 places, 1534 transitions, 21053 flow [2022-01-19 03:53:57,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1152 places, 1534 transitions, 19385 flow, removed 687 selfloop flow, removed 26 redundant places. [2022-01-19 03:53:57,872 INFO L242 Difference]: Finished difference. Result has 1184 places, 1266 transitions, 14025 flow [2022-01-19 03:53:57,872 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-19 03:53:57,873 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 930 predicate places. [2022-01-19 03:53:57,873 INFO L470 AbstractCegarLoop]: Abstraction has has 1184 places, 1266 transitions, 14025 flow [2022-01-19 03:53:57,874 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-19 03:53:57,874 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:57,874 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-19 03:53:57,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 03:53:57,874 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-19 03:53:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -730839727, now seen corresponding path program 11 times [2022-01-19 03:53:57,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:57,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161324102] [2022-01-19 03:53:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:57,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:16,916 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-19 03:54:16,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:16,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161324102] [2022-01-19 03:54:16,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161324102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:54:16,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:54:16,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-01-19 03:54:16,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752834193] [2022-01-19 03:54:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:54:16,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-19 03:54:16,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-19 03:54:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2395, Unknown=0, NotChecked=0, Total=2550 [2022-01-19 03:54:16,920 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2022-01-19 03:54:16,922 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-19 03:54:16,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:16,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2022-01-19 03:54:16,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:52,739 INFO L129 PetriNetUnfolder]: 16406/39049 cut-off events. [2022-01-19 03:54:52,739 INFO L130 PetriNetUnfolder]: For 10193442/10193776 co-relation queries the response was YES. [2022-01-19 03:54:54,883 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-19 03:54:55,157 INFO L132 encePairwiseOnDemand]: 216/274 looper letters, 788 selfloop transitions, 763 changer transitions 9/1711 dead transitions. [2022-01-19 03:54:55,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1261 places, 1711 transitions, 25384 flow [2022-01-19 03:54:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-19 03:54:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-01-19 03:54:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 10581 transitions. [2022-01-19 03:54:55,164 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4950870297585626 [2022-01-19 03:54:55,164 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 10581 transitions. [2022-01-19 03:54:55,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 10581 transitions. [2022-01-19 03:54:55,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:55,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 10581 transitions. [2022-01-19 03:54:55,172 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-19 03:54:55,182 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-19 03:54:55,184 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-19 03:54:55,184 INFO L186 Difference]: Start difference. First operand has 1184 places, 1266 transitions, 14025 flow. Second operand 78 states and 10581 transitions. [2022-01-19 03:54:55,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1261 places, 1711 transitions, 25384 flow [2022-01-19 03:55:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1248 places, 1711 transitions, 23942 flow, removed 703 selfloop flow, removed 13 redundant places. [2022-01-19 03:55:16,577 INFO L242 Difference]: Finished difference. Result has 1283 places, 1390 transitions, 18163 flow [2022-01-19 03:55:16,578 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-19 03:55:16,578 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1029 predicate places. [2022-01-19 03:55:16,578 INFO L470 AbstractCegarLoop]: Abstraction has has 1283 places, 1390 transitions, 18163 flow [2022-01-19 03:55:16,579 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-19 03:55:16,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:55:16,579 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-19 03:55:16,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 03:55:16,579 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-19 03:55:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:55:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1961893625, now seen corresponding path program 12 times [2022-01-19 03:55:16,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:55:16,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127467842] [2022-01-19 03:55:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:55:16,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:55:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:55:33,337 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-19 03:55:33,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:55:33,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127467842] [2022-01-19 03:55:33,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127467842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:55:33,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:55:33,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 03:55:33,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482091603] [2022-01-19 03:55:33,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:55:33,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 03:55:33,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:55:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 03:55:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 03:55:33,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 03:55:33,343 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-19 03:55:33,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:55:33,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 03:55:33,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:56:14,287 INFO L129 PetriNetUnfolder]: 18806/45103 cut-off events. [2022-01-19 03:56:14,288 INFO L130 PetriNetUnfolder]: For 14243187/14243595 co-relation queries the response was YES. [2022-01-19 03:56:17,340 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-19 03:56:17,544 INFO L132 encePairwiseOnDemand]: 219/274 looper letters, 1296 selfloop transitions, 458 changer transitions 14/1926 dead transitions. [2022-01-19 03:56:17,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1356 places, 1926 transitions, 34658 flow [2022-01-19 03:56:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 03:56:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 03:56:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 10546 transitions. [2022-01-19 03:56:17,552 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.520122312093115 [2022-01-19 03:56:17,552 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 10546 transitions. [2022-01-19 03:56:17,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 10546 transitions. [2022-01-19 03:56:17,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:56:17,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 10546 transitions. [2022-01-19 03:56:17,562 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-19 03:56:17,574 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-19 03:56:17,576 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-19 03:56:17,576 INFO L186 Difference]: Start difference. First operand has 1283 places, 1390 transitions, 18163 flow. Second operand 74 states and 10546 transitions. [2022-01-19 03:56:17,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1356 places, 1926 transitions, 34658 flow [2022-01-19 03:56:51,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1305 places, 1926 transitions, 32172 flow, removed 1068 selfloop flow, removed 51 redundant places. [2022-01-19 03:56:51,645 INFO L242 Difference]: Finished difference. Result has 1341 places, 1572 transitions, 21888 flow [2022-01-19 03:56:51,646 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-19 03:56:51,646 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1087 predicate places. [2022-01-19 03:56:51,646 INFO L470 AbstractCegarLoop]: Abstraction has has 1341 places, 1572 transitions, 21888 flow [2022-01-19 03:56:51,647 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-19 03:56:51,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:56:51,647 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-19 03:56:51,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 03:56:51,647 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-19 03:56:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:56:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1473864735, now seen corresponding path program 13 times [2022-01-19 03:56:51,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:56:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807601226] [2022-01-19 03:56:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:56:51,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:56:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:57:09,781 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-19 03:57:09,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:57:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807601226] [2022-01-19 03:57:09,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807601226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:57:09,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:57:09,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:57:09,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97954616] [2022-01-19 03:57:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:57:09,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:57:09,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:57:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:57:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:57:09,784 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 03:57:09,786 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-19 03:57:09,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:57:09,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 03:57:09,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:57:55,669 INFO L129 PetriNetUnfolder]: 20671/49172 cut-off events. [2022-01-19 03:57:55,669 INFO L130 PetriNetUnfolder]: For 13892670/13893442 co-relation queries the response was YES. [2022-01-19 03:57:59,421 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-19 03:57:59,629 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1173 selfloop transitions, 756 changer transitions 0/2087 dead transitions. [2022-01-19 03:57:59,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1416 places, 2087 transitions, 42646 flow [2022-01-19 03:57:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-19 03:57:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-01-19 03:57:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 10851 transitions. [2022-01-19 03:57:59,635 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5210814444871302 [2022-01-19 03:57:59,635 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 10851 transitions. [2022-01-19 03:57:59,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 10851 transitions. [2022-01-19 03:57:59,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:57:59,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 10851 transitions. [2022-01-19 03:57:59,642 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-19 03:57:59,650 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-19 03:57:59,651 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-19 03:57:59,651 INFO L186 Difference]: Start difference. First operand has 1341 places, 1572 transitions, 21888 flow. Second operand 76 states and 10851 transitions. [2022-01-19 03:57:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1416 places, 2087 transitions, 42646 flow [2022-01-19 03:58:33,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1394 places, 2087 transitions, 38751 flow, removed 1810 selfloop flow, removed 22 redundant places. [2022-01-19 03:58:33,389 INFO L242 Difference]: Finished difference. Result has 1423 places, 1697 transitions, 24974 flow [2022-01-19 03:58:33,390 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-19 03:58:33,390 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1169 predicate places. [2022-01-19 03:58:33,390 INFO L470 AbstractCegarLoop]: Abstraction has has 1423 places, 1697 transitions, 24974 flow [2022-01-19 03:58:33,391 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-19 03:58:33,391 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:58:33,391 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-19 03:58:33,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 03:58:33,391 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-19 03:58:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:58:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1644941945, now seen corresponding path program 14 times [2022-01-19 03:58:33,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:58:33,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087058849] [2022-01-19 03:58:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:58:33,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:58:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:58:48,310 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-19 03:58:48,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:58:48,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087058849] [2022-01-19 03:58:48,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087058849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:58:48,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:58:48,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 03:58:48,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419914630] [2022-01-19 03:58:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:58:48,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:58:48,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:58:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:58:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2011, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:58:48,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 03:58:48,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1423 places, 1697 transitions, 24974 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-19 03:58:48,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:58:48,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 03:58:48,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:59:37,602 INFO L129 PetriNetUnfolder]: 21642/51708 cut-off events. [2022-01-19 03:59:37,603 INFO L130 PetriNetUnfolder]: For 15350980/15351644 co-relation queries the response was YES. [2022-01-19 03:59:43,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368389 conditions, 51708 events. 21642/51708 cut-off events. For 15350980/15351644 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 531272 event pairs, 5090 based on Foata normal form. 238/50739 useless extension candidates. Maximal degree in co-relation 367960. Up to 27596 conditions per place. [2022-01-19 03:59:43,563 INFO L132 encePairwiseOnDemand]: 219/274 looper letters, 1527 selfloop transitions, 400 changer transitions 0/2085 dead transitions. [2022-01-19 03:59:43,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1490 places, 2085 transitions, 39437 flow [2022-01-19 03:59:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-19 03:59:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2022-01-19 03:59:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 9674 transitions. [2022-01-19 03:59:43,570 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5192142550450837 [2022-01-19 03:59:43,570 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 9674 transitions. [2022-01-19 03:59:43,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 9674 transitions. [2022-01-19 03:59:43,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:59:43,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 9674 transitions. [2022-01-19 03:59:43,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 142.26470588235293) internal successors, (9674), 68 states have internal predecessors, (9674), 0 states have call successors, (0), 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-19 03:59:43,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 274.0) internal successors, (18906), 69 states have internal predecessors, (18906), 0 states have call successors, (0), 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-19 03:59:43,585 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 274.0) internal successors, (18906), 69 states have internal predecessors, (18906), 0 states have call successors, (0), 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-19 03:59:43,585 INFO L186 Difference]: Start difference. First operand has 1423 places, 1697 transitions, 24974 flow. Second operand 68 states and 9674 transitions. [2022-01-19 03:59:43,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1490 places, 2085 transitions, 39437 flow [2022-01-19 04:00:22,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1462 places, 2085 transitions, 36784 flow, removed 1138 selfloop flow, removed 28 redundant places. [2022-01-19 04:00:22,322 INFO L242 Difference]: Finished difference. Result has 1489 places, 1779 transitions, 26481 flow [2022-01-19 04:00:22,323 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=22804, PETRI_DIFFERENCE_MINUEND_PLACES=1395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=26481, PETRI_PLACES=1489, PETRI_TRANSITIONS=1779} [2022-01-19 04:00:22,323 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1235 predicate places. [2022-01-19 04:00:22,323 INFO L470 AbstractCegarLoop]: Abstraction has has 1489 places, 1779 transitions, 26481 flow [2022-01-19 04:00:22,324 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-19 04:00:22,324 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:00:22,324 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-19 04:00:22,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 04:00:22,324 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 04:00:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:00:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2133496263, now seen corresponding path program 15 times [2022-01-19 04:00:22,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:00:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758566799] [2022-01-19 04:00:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:00:22,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:00:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-01-19 04:00:34,302 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,308 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 04:00:34,308 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,309 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,310 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,311 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,320 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,321 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,321 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,327 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,328 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,330 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,332 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,333 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,333 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,335 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,336 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,337 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,338 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,339 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,339 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,340 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,341 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,342 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,342 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,343 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,344 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,345 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,346 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,347 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,348 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,348 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,349 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,349 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,349 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,350 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,355 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,356 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,356 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,356 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,356 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,357 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,357 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,357 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,357 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,358 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,358 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,358 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,358 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,358 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,359 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,360 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,360 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,360 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,360 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-01-19 04:00:34,364 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 04:00:34,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 04:00:34,364 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 203 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 201 interpolants. [2022-01-19 04:00:34,366 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 04:00:34,366 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 04:00:34,366 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 04:00:34,366 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-01-19 04:00:34,366 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-19 04:00:34,366 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 04:00:34,368 INFO L732 BasicCegarLoop]: Path program histogram: [15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:00:34,370 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:00:34,370 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:00:34,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:00:34 BasicIcfg [2022-01-19 04:00:34,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:00:34,373 INFO L158 Benchmark]: Toolchain (without parser) took 798414.45ms. Allocated memory was 379.6MB in the beginning and 15.1GB in the end (delta: 14.7GB). Free memory was 324.5MB in the beginning and 9.5GB in the end (delta: -9.2GB). Peak memory consumption was 13.2GB. Max. memory is 16.0GB. [2022-01-19 04:00:34,373 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory is still 343.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:00:34,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.72ms. Allocated memory was 379.6MB in the beginning and 509.6MB in the end (delta: 130.0MB). Free memory was 324.4MB in the beginning and 463.3MB in the end (delta: -138.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.0GB. [2022-01-19 04:00:34,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.50ms. Allocated memory is still 509.6MB. Free memory was 463.3MB in the beginning and 460.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:00:34,373 INFO L158 Benchmark]: Boogie Preprocessor took 36.63ms. Allocated memory is still 509.6MB. Free memory was 460.2MB in the beginning and 458.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:00:34,374 INFO L158 Benchmark]: RCFGBuilder took 433.71ms. Allocated memory is still 509.6MB. Free memory was 458.1MB in the beginning and 436.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2022-01-19 04:00:34,374 INFO L158 Benchmark]: TraceAbstraction took 797338.24ms. Allocated memory was 509.6MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 436.1MB in the beginning and 9.5GB in the end (delta: -9.1GB). Peak memory consumption was 13.2GB. Max. memory is 16.0GB. [2022-01-19 04:00:34,378 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.10ms. Allocated memory is still 379.6MB. Free memory is still 343.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 527.72ms. Allocated memory was 379.6MB in the beginning and 509.6MB in the end (delta: 130.0MB). Free memory was 324.4MB in the beginning and 463.3MB in the end (delta: -138.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.50ms. Allocated memory is still 509.6MB. Free memory was 463.3MB in the beginning and 460.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.63ms. Allocated memory is still 509.6MB. Free memory was 460.2MB in the beginning and 458.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 433.71ms. Allocated memory is still 509.6MB. Free memory was 458.1MB in the beginning and 436.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 797338.24ms. Allocated memory was 509.6MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 436.1MB in the beginning and 9.5GB in the end (delta: -9.1GB). Peak memory consumption was 13.2GB. 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 NestedInterpolantsBuilder was constructing predicates for 201 interpolants. - 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 NestedInterpolantsBuilder was constructing predicates for 201 interpolants. - 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 NestedInterpolantsBuilder was constructing predicates for 201 interpolants. - 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 NestedInterpolantsBuilder was constructing predicates for 201 interpolants. - 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 NestedInterpolantsBuilder was constructing predicates for 201 interpolants. - 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: 797.1s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 617.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20844 SdHoareTripleChecker+Valid, 57.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20844 mSDsluCounter, 52646 SdHoareTripleChecker+Invalid, 49.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53862 mSDsCounter, 2502 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90943 IncrementalHoareTripleChecker+Invalid, 93445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2502 mSolverCounterUnsat, 3102 mSDtfsCounter, 90943 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2782 GetRequests, 802 SyntacticMatches, 36 SemanticMatches, 1944 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55060 ImplicationChecksByTransitivity, 137.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26481occurred in iteration=28, InterpolantAutomatonStates: 1208, 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.6s SatisfiabilityAnalysisTime, 166.3s InterpolantComputationTime, 4592 NumberOfCodeBlocks, 4592 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4564 ConstructedInterpolants, 0 QuantifiedInterpolants, 201661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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 [2022-01-19 04:00:34,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 !ENTRY org.eclipse.osgi 4 0 2022-01-19 04:00:34.628 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ae1570/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ae1570/.metadata/.log.