/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-After.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 10:06:57,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 10:06:57,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 10:06:57,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 10:06:57,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 10:06:57,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 10:06:57,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 10:06:57,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 10:06:57,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 10:06:57,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 10:06:57,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 10:06:57,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 10:06:57,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 10:06:57,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 10:06:57,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 10:06:57,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 10:06:57,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 10:06:57,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 10:06:57,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 10:06:57,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 10:06:57,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 10:06:57,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 10:06:57,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 10:06:57,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 10:06:57,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 10:06:57,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 10:06:57,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 10:06:57,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 10:06:57,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 10:06:57,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 10:06:57,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 10:06:57,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 10:06:57,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 10:06:57,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 10:06:57,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 10:06:57,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 10:06:57,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 10:06:57,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 10:06:57,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 10:06:57,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 10:06:57,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 10:06:58,000 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-After.epf [2022-01-19 10:06:58,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 10:06:58,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 10:06:58,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 10:06:58,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 10:06:58,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 10:06:58,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 10:06:58,032 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 10:06:58,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 10:06:58,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 10:06:58,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 10:06:58,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 10:06:58,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 10:06:58,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 10:06:58,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 10:06:58,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 10:06:58,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 10:06:58,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 10:06:58,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 10:06:58,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 10:06:58,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 10:06:58,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 10:06:58,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 10:06:58,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 10:06:58,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:06:58,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 10:06:58,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 10:06:58,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 10:06:58,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 10:06:58,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 10:06:58,036 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 10:06:58,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 10:06:58,036 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 10:06:58,037 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 10:06:58,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 10:06:58,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 10:06:58,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 10:06:58,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 10:06:58,262 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 10:06:58,263 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 10:06:58,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437be7c54/7331debea1fd474da9326ca561abf642/FLAG61da5cb3f [2022-01-19 10:06:58,739 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 10:06:58,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-01-19 10:06:58,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437be7c54/7331debea1fd474da9326ca561abf642/FLAG61da5cb3f [2022-01-19 10:06:59,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437be7c54/7331debea1fd474da9326ca561abf642 [2022-01-19 10:06:59,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 10:06:59,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 10:06:59,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 10:06:59,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 10:06:59,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 10:06:59,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2647c089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59, skipping insertion in model container [2022-01-19 10:06:59,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 10:06:59,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 10:06:59,452 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 10:06:59,458 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 10:06:59,466 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 10:06:59,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:06:59,477 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 10:06:59,514 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 10:06:59,515 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 10:06:59,517 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 10:06:59,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:06:59,560 INFO L208 MainTranslator]: Completed translation [2022-01-19 10:06:59,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59 WrapperNode [2022-01-19 10:06:59,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 10:06:59,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 10:06:59,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 10:06:59,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 10:06:59,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,611 INFO L137 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-01-19 10:06:59,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 10:06:59,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 10:06:59,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 10:06:59,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 10:06:59,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 10:06:59,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 10:06:59,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 10:06:59,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 10:06:59,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (1/1) ... [2022-01-19 10:06:59,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:06:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:06:59,687 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 10:06:59,688 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 10:06:59,713 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 10:06:59,713 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 10:06:59,713 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 10:06:59,714 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 10:06:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 10:06:59,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 10:06:59,716 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 10:06:59,820 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 10:06:59,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 10:07:00,166 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 10:07:00,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 10:07:00,178 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 10:07:00,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:07:00 BoogieIcfgContainer [2022-01-19 10:07:00,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 10:07:00,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 10:07:00,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 10:07:00,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 10:07:00,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 10:06:59" (1/3) ... [2022-01-19 10:07:00,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e57beba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:07:00, skipping insertion in model container [2022-01-19 10:07:00,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:06:59" (2/3) ... [2022-01-19 10:07:00,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e57beba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:07:00, skipping insertion in model container [2022-01-19 10:07:00,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:07:00" (3/3) ... [2022-01-19 10:07:00,188 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-01-19 10:07:00,193 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 10:07:00,193 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 10:07:00,193 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 10:07:00,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,273 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,275 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,275 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,275 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,275 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,276 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,276 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,278 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,281 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,289 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,290 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,292 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,309 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,309 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,309 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,309 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,309 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,310 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,310 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,313 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,313 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,313 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,313 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,314 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,315 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,316 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,317 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,318 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,319 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,321 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,322 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,322 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,322 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,322 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,322 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,322 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,323 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,323 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,323 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,323 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,324 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,325 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,328 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,329 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,329 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,329 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,330 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,330 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,330 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,330 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,330 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,330 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,331 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,336 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,336 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,336 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,340 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,340 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,340 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,340 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,340 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,341 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,342 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,342 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,342 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,342 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,342 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,347 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,348 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,349 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,351 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,351 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,351 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,353 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,353 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,353 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,353 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,353 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,354 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,355 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,356 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,357 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,358 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,359 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,359 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,359 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,364 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,364 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,364 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,365 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,366 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,366 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,367 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,368 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,369 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,369 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,369 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,369 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,372 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,373 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,373 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,373 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,373 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,373 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,377 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,378 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,379 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,380 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,381 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,381 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,381 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,381 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,381 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,381 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,385 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,386 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,387 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,388 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,389 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,390 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,391 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,392 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,392 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,392 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,392 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,392 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,393 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,394 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,395 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,406 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,407 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,408 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,408 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,408 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,408 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,408 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,408 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:07:00,413 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 10:07:00,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 10:07:00,479 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 10:07:00,479 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 10:07:00,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 266 places, 274 transitions, 564 flow [2022-01-19 10:07:00,608 INFO L129 PetriNetUnfolder]: 15/272 cut-off events. [2022-01-19 10:07:00,608 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 10:07:00,621 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 10:07:00,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 274 transitions, 564 flow [2022-01-19 10:07:00,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 262 transitions, 533 flow [2022-01-19 10:07:00,643 INFO L129 PetriNetUnfolder]: 2/66 cut-off events. [2022-01-19 10:07:00,643 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 10:07:00,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:00,644 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 10:07:00,644 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 10:07:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash -266547570, now seen corresponding path program 1 times [2022-01-19 10:07:00,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:00,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63074733] [2022-01-19 10:07:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:00,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:00,879 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 10:07:00,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:00,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63074733] [2022-01-19 10:07:00,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63074733] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:00,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:00,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 10:07:00,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207220511] [2022-01-19 10:07:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:00,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 10:07:00,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 10:07:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 10:07:00,928 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 274 [2022-01-19 10:07:00,932 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 10:07:00,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:00,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 274 [2022-01-19 10:07:00,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:01,007 INFO L129 PetriNetUnfolder]: 10/251 cut-off events. [2022-01-19 10:07:01,007 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-01-19 10:07:01,010 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 10:07:01,012 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 3 selfloop transitions, 0 changer transitions 0/251 dead transitions. [2022-01-19 10:07:01,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 251 transitions, 517 flow [2022-01-19 10:07:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 10:07:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 10:07:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 530 transitions. [2022-01-19 10:07:01,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9671532846715328 [2022-01-19 10:07:01,030 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 530 transitions. [2022-01-19 10:07:01,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 530 transitions. [2022-01-19 10:07:01,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:01,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 530 transitions. [2022-01-19 10:07:01,042 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 10:07:01,051 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 10:07:01,051 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 10:07:01,053 INFO L186 Difference]: Start difference. First operand has 254 places, 262 transitions, 533 flow. Second operand 2 states and 530 transitions. [2022-01-19 10:07:01,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 251 transitions, 517 flow [2022-01-19 10:07:01,058 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 10:07:01,063 INFO L242 Difference]: Finished difference. Result has 246 places, 251 transitions, 506 flow [2022-01-19 10:07:01,064 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 10:07:01,067 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-19 10:07:01,067 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 251 transitions, 506 flow [2022-01-19 10:07:01,068 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 10:07:01,068 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:01,068 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:01,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 10:07:01,069 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 10:07:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1627698218, now seen corresponding path program 1 times [2022-01-19 10:07:01,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:01,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127736084] [2022-01-19 10:07:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:01,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:01,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 10:07:01,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127736084] [2022-01-19 10:07:01,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127736084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:01,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:01,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 10:07:01,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208108149] [2022-01-19 10:07:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:01,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 10:07:01,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:01,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 10:07:01,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-19 10:07:01,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 274 [2022-01-19 10:07:01,453 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 10:07:01,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:01,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 274 [2022-01-19 10:07:01,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:02,422 INFO L129 PetriNetUnfolder]: 1003/4117 cut-off events. [2022-01-19 10:07:02,422 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-19 10:07:02,433 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 10:07:02,450 INFO L132 encePairwiseOnDemand]: 261/274 looper letters, 52 selfloop transitions, 12 changer transitions 0/247 dead transitions. [2022-01-19 10:07:02,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 247 transitions, 626 flow [2022-01-19 10:07:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 10:07:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 10:07:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2626 transitions. [2022-01-19 10:07:02,456 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7372262773722628 [2022-01-19 10:07:02,456 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2626 transitions. [2022-01-19 10:07:02,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2626 transitions. [2022-01-19 10:07:02,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:02,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2626 transitions. [2022-01-19 10:07:02,463 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 10:07:02,469 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 10:07:02,471 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 10:07:02,471 INFO L186 Difference]: Start difference. First operand has 246 places, 251 transitions, 506 flow. Second operand 13 states and 2626 transitions. [2022-01-19 10:07:02,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 247 transitions, 626 flow [2022-01-19 10:07:02,474 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 10:07:02,481 INFO L242 Difference]: Finished difference. Result has 255 places, 247 transitions, 522 flow [2022-01-19 10:07:02,481 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 10:07:02,482 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1 predicate places. [2022-01-19 10:07:02,482 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 247 transitions, 522 flow [2022-01-19 10:07:02,484 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 10:07:02,484 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:02,484 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 10:07:02,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 10:07:02,484 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 10:07:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2013468752, now seen corresponding path program 1 times [2022-01-19 10:07:02,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:02,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149976686] [2022-01-19 10:07:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:02,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:02,589 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 10:07:02,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:02,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149976686] [2022-01-19 10:07:02,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149976686] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:02,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:02,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:07:02,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038956611] [2022-01-19 10:07:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:02,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:07:02,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:07:02,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:07:02,593 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 274 [2022-01-19 10:07:02,594 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 10:07:02,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:02,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 274 [2022-01-19 10:07:02,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:02,662 INFO L129 PetriNetUnfolder]: 26/432 cut-off events. [2022-01-19 10:07:02,662 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 10:07:02,664 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 10:07:02,665 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 9 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2022-01-19 10:07:02,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 247 transitions, 554 flow [2022-01-19 10:07:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 10:07:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 10:07:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1015 transitions. [2022-01-19 10:07:02,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.926094890510949 [2022-01-19 10:07:02,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1015 transitions. [2022-01-19 10:07:02,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1015 transitions. [2022-01-19 10:07:02,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:02,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1015 transitions. [2022-01-19 10:07:02,670 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 10:07:02,672 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 10:07:02,673 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 10:07:02,673 INFO L186 Difference]: Start difference. First operand has 255 places, 247 transitions, 522 flow. Second operand 4 states and 1015 transitions. [2022-01-19 10:07:02,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 247 transitions, 554 flow [2022-01-19 10:07:02,675 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 10:07:02,677 INFO L242 Difference]: Finished difference. Result has 246 places, 245 transitions, 505 flow [2022-01-19 10:07:02,678 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 10:07:02,680 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-19 10:07:02,680 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 245 transitions, 505 flow [2022-01-19 10:07:02,681 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 10:07:02,681 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:02,681 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 10:07:02,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 10:07:02,681 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 10:07:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1617079602, now seen corresponding path program 1 times [2022-01-19 10:07:02,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:02,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417158759] [2022-01-19 10:07:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:02,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:02,774 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 10:07:02,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417158759] [2022-01-19 10:07:02,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417158759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:02,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:02,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:07:02,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429460982] [2022-01-19 10:07:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:02,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:07:02,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:07:02,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:07:02,782 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 274 [2022-01-19 10:07:02,783 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 10:07:02,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:02,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 274 [2022-01-19 10:07:02,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:02,851 INFO L129 PetriNetUnfolder]: 33/527 cut-off events. [2022-01-19 10:07:02,852 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-01-19 10:07:02,854 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 10:07:02,856 INFO L132 encePairwiseOnDemand]: 270/274 looper letters, 10 selfloop transitions, 3 changer transitions 0/249 dead transitions. [2022-01-19 10:07:02,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 249 transitions, 542 flow [2022-01-19 10:07:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:07:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:07:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2022-01-19 10:07:02,858 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9476885644768857 [2022-01-19 10:07:02,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2022-01-19 10:07:02,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2022-01-19 10:07:02,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:02,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2022-01-19 10:07:02,860 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 10:07:02,861 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 10:07:02,861 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 10:07:02,862 INFO L186 Difference]: Start difference. First operand has 246 places, 245 transitions, 505 flow. Second operand 3 states and 779 transitions. [2022-01-19 10:07:02,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 249 transitions, 542 flow [2022-01-19 10:07:02,864 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 10:07:02,866 INFO L242 Difference]: Finished difference. Result has 246 places, 246 transitions, 510 flow [2022-01-19 10:07:02,867 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 10:07:02,868 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2022-01-19 10:07:02,868 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 246 transitions, 510 flow [2022-01-19 10:07:02,869 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 10:07:02,869 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:02,869 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 10:07:02,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 10:07:02,869 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 10:07:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 771775214, now seen corresponding path program 1 times [2022-01-19 10:07:02,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:02,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097286234] [2022-01-19 10:07:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:02,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:02,953 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 10:07:02,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:02,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097286234] [2022-01-19 10:07:02,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097286234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:02,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:02,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:07:02,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748853599] [2022-01-19 10:07:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:02,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:07:02,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:02,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:07:02,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:07:02,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 274 [2022-01-19 10:07:02,957 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 10:07:02,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:02,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 274 [2022-01-19 10:07:02,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:03,100 INFO L129 PetriNetUnfolder]: 51/836 cut-off events. [2022-01-19 10:07:03,100 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 10:07:03,104 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 10:07:03,106 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 15 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-01-19 10:07:03,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 573 flow [2022-01-19 10:07:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 10:07:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 10:07:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1281 transitions. [2022-01-19 10:07:03,110 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935036496350365 [2022-01-19 10:07:03,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1281 transitions. [2022-01-19 10:07:03,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1281 transitions. [2022-01-19 10:07:03,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:03,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1281 transitions. [2022-01-19 10:07:03,113 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 10:07:03,115 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 10:07:03,115 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 10:07:03,115 INFO L186 Difference]: Start difference. First operand has 246 places, 246 transitions, 510 flow. Second operand 5 states and 1281 transitions. [2022-01-19 10:07:03,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 573 flow [2022-01-19 10:07:03,117 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 10:07:03,120 INFO L242 Difference]: Finished difference. Result has 252 places, 249 transitions, 537 flow [2022-01-19 10:07:03,121 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 10:07:03,121 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, -2 predicate places. [2022-01-19 10:07:03,121 INFO L470 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 537 flow [2022-01-19 10:07:03,122 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 10:07:03,122 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:03,122 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 10:07:03,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 10:07:03,122 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 10:07:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -703749757, now seen corresponding path program 1 times [2022-01-19 10:07:03,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:03,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580685916] [2022-01-19 10:07:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:03,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:03,620 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 10:07:03,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580685916] [2022-01-19 10:07:03,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580685916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:03,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:03,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 10:07:03,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319014147] [2022-01-19 10:07:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:03,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 10:07:03,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 10:07:03,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-01-19 10:07:03,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 274 [2022-01-19 10:07:03,630 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 10:07:03,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:03,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 274 [2022-01-19 10:07:03,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:05,072 INFO L129 PetriNetUnfolder]: 1599/6669 cut-off events. [2022-01-19 10:07:05,073 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-01-19 10:07:05,090 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 10:07:05,112 INFO L132 encePairwiseOnDemand]: 258/274 looper letters, 79 selfloop transitions, 20 changer transitions 0/271 dead transitions. [2022-01-19 10:07:05,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 271 transitions, 781 flow [2022-01-19 10:07:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 10:07:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 10:07:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2876 transitions. [2022-01-19 10:07:05,119 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6997566909975669 [2022-01-19 10:07:05,119 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2876 transitions. [2022-01-19 10:07:05,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2876 transitions. [2022-01-19 10:07:05,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:05,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2876 transitions. [2022-01-19 10:07:05,149 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 10:07:05,154 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 10:07:05,156 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 10:07:05,156 INFO L186 Difference]: Start difference. First operand has 252 places, 249 transitions, 537 flow. Second operand 15 states and 2876 transitions. [2022-01-19 10:07:05,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 271 transitions, 781 flow [2022-01-19 10:07:05,158 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 10:07:05,161 INFO L242 Difference]: Finished difference. Result has 272 places, 262 transitions, 644 flow [2022-01-19 10:07:05,161 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 10:07:05,162 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 18 predicate places. [2022-01-19 10:07:05,162 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 262 transitions, 644 flow [2022-01-19 10:07:05,163 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 10:07:05,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:05,164 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 10:07:05,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 10:07:05,164 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 10:07:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -940168002, now seen corresponding path program 1 times [2022-01-19 10:07:05,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:05,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770261508] [2022-01-19 10:07:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:05,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:06,198 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 10:07:06,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:06,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770261508] [2022-01-19 10:07:06,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770261508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:06,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:06,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 10:07:06,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751011226] [2022-01-19 10:07:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:06,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 10:07:06,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:06,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 10:07:06,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-01-19 10:07:06,205 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 274 [2022-01-19 10:07:06,209 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 10:07:06,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:06,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 274 [2022-01-19 10:07:06,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:09,175 INFO L129 PetriNetUnfolder]: 1457/6029 cut-off events. [2022-01-19 10:07:09,175 INFO L130 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-01-19 10:07:09,269 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 10:07:09,288 INFO L132 encePairwiseOnDemand]: 243/274 looper letters, 88 selfloop transitions, 45 changer transitions 0/297 dead transitions. [2022-01-19 10:07:09,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 1004 flow [2022-01-19 10:07:09,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 10:07:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 10:07:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4778 transitions. [2022-01-19 10:07:09,300 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6458502297918356 [2022-01-19 10:07:09,301 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4778 transitions. [2022-01-19 10:07:09,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4778 transitions. [2022-01-19 10:07:09,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:09,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4778 transitions. [2022-01-19 10:07:09,313 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 10:07:09,335 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 10:07:09,338 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 10:07:09,338 INFO L186 Difference]: Start difference. First operand has 272 places, 262 transitions, 644 flow. Second operand 27 states and 4778 transitions. [2022-01-19 10:07:09,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 1004 flow [2022-01-19 10:07:09,347 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 10:07:09,351 INFO L242 Difference]: Finished difference. Result has 303 places, 284 transitions, 870 flow [2022-01-19 10:07:09,352 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 10:07:09,357 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 49 predicate places. [2022-01-19 10:07:09,357 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 284 transitions, 870 flow [2022-01-19 10:07:09,358 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 10:07:09,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:09,359 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 10:07:09,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 10:07:09,360 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 10:07:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1623156073, now seen corresponding path program 1 times [2022-01-19 10:07:09,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:09,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205247641] [2022-01-19 10:07:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:09,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:10,047 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 10:07:10,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205247641] [2022-01-19 10:07:10,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205247641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:10,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:10,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 10:07:10,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751216523] [2022-01-19 10:07:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:10,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 10:07:10,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:10,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 10:07:10,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-19 10:07:10,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-19 10:07:10,053 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 10:07:10,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:10,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-19 10:07:10,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:11,788 INFO L129 PetriNetUnfolder]: 1619/6777 cut-off events. [2022-01-19 10:07:11,788 INFO L130 PetriNetUnfolder]: For 451/455 co-relation queries the response was YES. [2022-01-19 10:07:11,812 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 10:07:11,832 INFO L132 encePairwiseOnDemand]: 253/274 looper letters, 117 selfloop transitions, 34 changer transitions 0/320 dead transitions. [2022-01-19 10:07:11,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 1284 flow [2022-01-19 10:07:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 10:07:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 10:07:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2913 transitions. [2022-01-19 10:07:11,840 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6644616788321168 [2022-01-19 10:07:11,841 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2913 transitions. [2022-01-19 10:07:11,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2913 transitions. [2022-01-19 10:07:11,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:11,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2913 transitions. [2022-01-19 10:07:11,847 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 10:07:11,852 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 10:07:11,853 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 10:07:11,853 INFO L186 Difference]: Start difference. First operand has 303 places, 284 transitions, 870 flow. Second operand 16 states and 2913 transitions. [2022-01-19 10:07:11,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 1284 flow [2022-01-19 10:07:11,858 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 10:07:11,863 INFO L242 Difference]: Finished difference. Result has 311 places, 294 transitions, 994 flow [2022-01-19 10:07:11,863 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 10:07:11,864 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 57 predicate places. [2022-01-19 10:07:11,864 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 294 transitions, 994 flow [2022-01-19 10:07:11,865 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 10:07:11,865 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:11,865 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 10:07:11,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 10:07:11,865 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 10:07:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -156557425, now seen corresponding path program 2 times [2022-01-19 10:07:11,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:11,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043870344] [2022-01-19 10:07:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:11,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:12,521 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 10:07:12,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:12,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043870344] [2022-01-19 10:07:12,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043870344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:12,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:12,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 10:07:12,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145306653] [2022-01-19 10:07:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:12,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 10:07:12,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:12,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 10:07:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-01-19 10:07:12,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-19 10:07:12,527 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 10:07:12,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:12,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-19 10:07:12,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:14,682 INFO L129 PetriNetUnfolder]: 1640/6855 cut-off events. [2022-01-19 10:07:14,683 INFO L130 PetriNetUnfolder]: For 708/712 co-relation queries the response was YES. [2022-01-19 10:07:14,716 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 10:07:14,736 INFO L132 encePairwiseOnDemand]: 254/274 looper letters, 118 selfloop transitions, 38 changer transitions 0/325 dead transitions. [2022-01-19 10:07:14,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 325 transitions, 1427 flow [2022-01-19 10:07:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 10:07:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 10:07:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2737 transitions. [2022-01-19 10:07:14,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6659367396593674 [2022-01-19 10:07:14,743 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2737 transitions. [2022-01-19 10:07:14,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2737 transitions. [2022-01-19 10:07:14,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:14,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2737 transitions. [2022-01-19 10:07:14,749 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 10:07:14,755 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 10:07:14,755 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 10:07:14,755 INFO L186 Difference]: Start difference. First operand has 311 places, 294 transitions, 994 flow. Second operand 15 states and 2737 transitions. [2022-01-19 10:07:14,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 325 transitions, 1427 flow [2022-01-19 10:07:14,761 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 10:07:14,765 INFO L242 Difference]: Finished difference. Result has 319 places, 300 transitions, 1140 flow [2022-01-19 10:07:14,765 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 10:07:14,766 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 65 predicate places. [2022-01-19 10:07:14,766 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 300 transitions, 1140 flow [2022-01-19 10:07:14,767 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 10:07:14,767 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:14,767 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:07:14,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 10:07:14,768 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 10:07:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 655539223, now seen corresponding path program 3 times [2022-01-19 10:07:14,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:14,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564300883] [2022-01-19 10:07:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:14,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:15,356 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 10:07:15,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:15,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564300883] [2022-01-19 10:07:15,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564300883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:15,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:15,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 10:07:15,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963057526] [2022-01-19 10:07:15,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:15,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 10:07:15,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:15,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 10:07:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-19 10:07:15,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 274 [2022-01-19 10:07:15,362 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 10:07:15,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:15,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 274 [2022-01-19 10:07:15,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:16,923 INFO L129 PetriNetUnfolder]: 1625/6840 cut-off events. [2022-01-19 10:07:16,923 INFO L130 PetriNetUnfolder]: For 1146/1150 co-relation queries the response was YES. [2022-01-19 10:07:16,946 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 10:07:16,961 INFO L132 encePairwiseOnDemand]: 257/274 looper letters, 101 selfloop transitions, 36 changer transitions 0/306 dead transitions. [2022-01-19 10:07:16,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 306 transitions, 1422 flow [2022-01-19 10:07:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 10:07:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 10:07:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2535 transitions. [2022-01-19 10:07:16,965 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6608446298227321 [2022-01-19 10:07:16,965 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2535 transitions. [2022-01-19 10:07:16,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2535 transitions. [2022-01-19 10:07:16,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:16,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2535 transitions. [2022-01-19 10:07:16,969 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 10:07:16,974 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 10:07:16,974 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 10:07:16,975 INFO L186 Difference]: Start difference. First operand has 319 places, 300 transitions, 1140 flow. Second operand 14 states and 2535 transitions. [2022-01-19 10:07:16,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 306 transitions, 1422 flow [2022-01-19 10:07:16,980 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 10:07:16,984 INFO L242 Difference]: Finished difference. Result has 319 places, 296 transitions, 1154 flow [2022-01-19 10:07:16,985 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 10:07:16,985 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 65 predicate places. [2022-01-19 10:07:16,985 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 296 transitions, 1154 flow [2022-01-19 10:07:16,986 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 10:07:16,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:16,986 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 10:07:16,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 10:07:16,986 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 10:07:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1000254974, now seen corresponding path program 1 times [2022-01-19 10:07:16,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488220421] [2022-01-19 10:07:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:16,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:18,577 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 10:07:18,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:18,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488220421] [2022-01-19 10:07:18,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488220421] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:18,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:18,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-19 10:07:18,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554528854] [2022-01-19 10:07:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:18,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 10:07:18,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 10:07:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-01-19 10:07:18,583 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 274 [2022-01-19 10:07:18,586 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 10:07:18,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:18,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 274 [2022-01-19 10:07:18,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:21,422 INFO L129 PetriNetUnfolder]: 847/3524 cut-off events. [2022-01-19 10:07:21,422 INFO L130 PetriNetUnfolder]: For 1183/1186 co-relation queries the response was YES. [2022-01-19 10:07:21,434 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 10:07:21,443 INFO L132 encePairwiseOnDemand]: 245/274 looper letters, 121 selfloop transitions, 52 changer transitions 0/320 dead transitions. [2022-01-19 10:07:21,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 320 transitions, 1567 flow [2022-01-19 10:07:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 10:07:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 10:07:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4489 transitions. [2022-01-19 10:07:21,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6067856177345229 [2022-01-19 10:07:21,450 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4489 transitions. [2022-01-19 10:07:21,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4489 transitions. [2022-01-19 10:07:21,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:21,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4489 transitions. [2022-01-19 10:07:21,456 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 10:07:21,463 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 10:07:21,464 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 10:07:21,464 INFO L186 Difference]: Start difference. First operand has 319 places, 296 transitions, 1154 flow. Second operand 27 states and 4489 transitions. [2022-01-19 10:07:21,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 320 transitions, 1567 flow [2022-01-19 10:07:21,470 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 10:07:21,473 INFO L242 Difference]: Finished difference. Result has 318 places, 287 transitions, 1154 flow [2022-01-19 10:07:21,474 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 10:07:21,474 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 64 predicate places. [2022-01-19 10:07:21,474 INFO L470 AbstractCegarLoop]: Abstraction has has 318 places, 287 transitions, 1154 flow [2022-01-19 10:07:21,476 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 10:07:21,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:21,476 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 10:07:21,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 10:07:21,476 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 10:07:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1409670591, now seen corresponding path program 1 times [2022-01-19 10:07:21,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:21,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50485121] [2022-01-19 10:07:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:21,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:21,529 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 10:07:21,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:21,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50485121] [2022-01-19 10:07:21,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50485121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:21,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:21,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:07:21,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413542475] [2022-01-19 10:07:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:21,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:07:21,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:07:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:07:21,531 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 274 [2022-01-19 10:07:21,532 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 10:07:21,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:21,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 274 [2022-01-19 10:07:21,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:21,656 INFO L129 PetriNetUnfolder]: 62/911 cut-off events. [2022-01-19 10:07:21,656 INFO L130 PetriNetUnfolder]: For 544/545 co-relation queries the response was YES. [2022-01-19 10:07:21,660 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 10:07:21,661 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 12 selfloop transitions, 6 changer transitions 0/289 dead transitions. [2022-01-19 10:07:21,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 289 transitions, 1197 flow [2022-01-19 10:07:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:07:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:07:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2022-01-19 10:07:21,663 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9306569343065694 [2022-01-19 10:07:21,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2022-01-19 10:07:21,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2022-01-19 10:07:21,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:21,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2022-01-19 10:07:21,664 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 10:07:21,665 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 10:07:21,666 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 10:07:21,666 INFO L186 Difference]: Start difference. First operand has 318 places, 287 transitions, 1154 flow. Second operand 3 states and 765 transitions. [2022-01-19 10:07:21,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 289 transitions, 1197 flow [2022-01-19 10:07:21,670 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 10:07:21,674 INFO L242 Difference]: Finished difference. Result has 297 places, 287 transitions, 1072 flow [2022-01-19 10:07:21,675 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 10:07:21,676 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 43 predicate places. [2022-01-19 10:07:21,677 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 287 transitions, 1072 flow [2022-01-19 10:07:21,677 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 10:07:21,677 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:21,677 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 10:07:21,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 10:07:21,677 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 10:07:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash -849021323, now seen corresponding path program 1 times [2022-01-19 10:07:21,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:21,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637532885] [2022-01-19 10:07:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:21,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:22,489 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 10:07:22,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:22,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637532885] [2022-01-19 10:07:22,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637532885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:22,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:22,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-19 10:07:22,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717418739] [2022-01-19 10:07:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:22,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 10:07:22,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 10:07:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-01-19 10:07:22,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 274 [2022-01-19 10:07:22,496 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 10:07:22,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:22,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 274 [2022-01-19 10:07:22,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:24,429 INFO L129 PetriNetUnfolder]: 393/1832 cut-off events. [2022-01-19 10:07:24,429 INFO L130 PetriNetUnfolder]: For 1081/1085 co-relation queries the response was YES. [2022-01-19 10:07:24,436 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 10:07:24,441 INFO L132 encePairwiseOnDemand]: 243/274 looper letters, 141 selfloop transitions, 56 changer transitions 0/342 dead transitions. [2022-01-19 10:07:24,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 342 transitions, 1639 flow [2022-01-19 10:07:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 10:07:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 10:07:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4780 transitions. [2022-01-19 10:07:24,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6230448383733055 [2022-01-19 10:07:24,449 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4780 transitions. [2022-01-19 10:07:24,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4780 transitions. [2022-01-19 10:07:24,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:24,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4780 transitions. [2022-01-19 10:07:24,456 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 10:07:24,464 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 10:07:24,465 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 10:07:24,465 INFO L186 Difference]: Start difference. First operand has 297 places, 287 transitions, 1072 flow. Second operand 28 states and 4780 transitions. [2022-01-19 10:07:24,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 342 transitions, 1639 flow [2022-01-19 10:07:24,472 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 10:07:24,475 INFO L242 Difference]: Finished difference. Result has 328 places, 294 transitions, 1223 flow [2022-01-19 10:07:24,476 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 10:07:24,476 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 74 predicate places. [2022-01-19 10:07:24,476 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 294 transitions, 1223 flow [2022-01-19 10:07:24,478 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 10:07:24,478 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:24,478 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 10:07:24,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 10:07:24,478 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 10:07:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:24,478 INFO L85 PathProgramCache]: Analyzing trace with hash 390492704, now seen corresponding path program 1 times [2022-01-19 10:07:24,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:24,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698681189] [2022-01-19 10:07:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:24,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:26,675 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 10:07:26,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:26,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698681189] [2022-01-19 10:07:26,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698681189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:26,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:26,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-19 10:07:26,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069900107] [2022-01-19 10:07:26,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:26,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-19 10:07:26,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:26,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-19 10:07:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2022-01-19 10:07:26,681 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 274 [2022-01-19 10:07:26,684 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 10:07:26,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:26,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 274 [2022-01-19 10:07:26,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:07:30,560 INFO L129 PetriNetUnfolder]: 539/2370 cut-off events. [2022-01-19 10:07:30,560 INFO L130 PetriNetUnfolder]: For 1650/1654 co-relation queries the response was YES. [2022-01-19 10:07:30,570 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 10:07:30,577 INFO L132 encePairwiseOnDemand]: 234/274 looper letters, 184 selfloop transitions, 66 changer transitions 0/386 dead transitions. [2022-01-19 10:07:30,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 386 transitions, 2006 flow [2022-01-19 10:07:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-19 10:07:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-01-19 10:07:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5564 transitions. [2022-01-19 10:07:30,590 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5801876955161627 [2022-01-19 10:07:30,590 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 5564 transitions. [2022-01-19 10:07:30,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 5564 transitions. [2022-01-19 10:07:30,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:07:30,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5564 transitions. [2022-01-19 10:07:30,600 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 10:07:30,613 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 10:07:30,614 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 10:07:30,615 INFO L186 Difference]: Start difference. First operand has 328 places, 294 transitions, 1223 flow. Second operand 35 states and 5564 transitions. [2022-01-19 10:07:30,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 386 transitions, 2006 flow [2022-01-19 10:07:30,623 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 10:07:30,630 INFO L242 Difference]: Finished difference. Result has 351 places, 309 transitions, 1373 flow [2022-01-19 10:07:30,631 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 10:07:30,631 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 97 predicate places. [2022-01-19 10:07:30,632 INFO L470 AbstractCegarLoop]: Abstraction has has 351 places, 309 transitions, 1373 flow [2022-01-19 10:07:30,633 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 10:07:30,633 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:07:30,633 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 10:07:30,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 10:07:30,633 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 10:07:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:07:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 538588479, now seen corresponding path program 1 times [2022-01-19 10:07:30,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:07:30,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387019185] [2022-01-19 10:07:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:07:30,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:07:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:07:55,656 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 10:07:55,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:07:55,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387019185] [2022-01-19 10:07:55,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387019185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:07:55,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:07:55,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 10:07:55,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148322017] [2022-01-19 10:07:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:07:55,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 10:07:55,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:07:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 10:07:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 10:07:55,662 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:07:55,665 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 10:07:55,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:07:55,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:07:55,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:08:13,525 INFO L129 PetriNetUnfolder]: 5938/14612 cut-off events. [2022-01-19 10:08:13,525 INFO L130 PetriNetUnfolder]: For 7358/7359 co-relation queries the response was YES. [2022-01-19 10:08:13,584 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 10:08:13,619 INFO L132 encePairwiseOnDemand]: 215/274 looper letters, 561 selfloop transitions, 165 changer transitions 57/903 dead transitions. [2022-01-19 10:08:13,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 903 transitions, 4669 flow [2022-01-19 10:08:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-19 10:08:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-01-19 10:08:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 10699 transitions. [2022-01-19 10:08:13,631 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5137821744141375 [2022-01-19 10:08:13,631 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 10699 transitions. [2022-01-19 10:08:13,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 10699 transitions. [2022-01-19 10:08:13,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:08:13,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 10699 transitions. [2022-01-19 10:08:13,646 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 10:08:13,666 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 10:08:13,671 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 10:08:13,671 INFO L186 Difference]: Start difference. First operand has 351 places, 309 transitions, 1373 flow. Second operand 76 states and 10699 transitions. [2022-01-19 10:08:13,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 903 transitions, 4669 flow [2022-01-19 10:08:13,715 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 10:08:13,723 INFO L242 Difference]: Finished difference. Result has 456 places, 420 transitions, 2514 flow [2022-01-19 10:08:13,724 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 10:08:13,724 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 202 predicate places. [2022-01-19 10:08:13,724 INFO L470 AbstractCegarLoop]: Abstraction has has 456 places, 420 transitions, 2514 flow [2022-01-19 10:08:13,726 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 10:08:13,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:08:13,726 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 10:08:13,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 10:08:13,726 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 10:08:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:08:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1559785829, now seen corresponding path program 2 times [2022-01-19 10:08:13,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:08:13,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178032246] [2022-01-19 10:08:13,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:08:13,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:08:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:08:16,810 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 10:08:16,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:08:16,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178032246] [2022-01-19 10:08:16,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178032246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:08:16,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:08:16,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:08:16,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130907309] [2022-01-19 10:08:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:08:16,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:08:16,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:08:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:08:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:08:16,817 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:08:16,820 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 10:08:16,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:08:16,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:08:16,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:08:31,012 INFO L129 PetriNetUnfolder]: 7561/18001 cut-off events. [2022-01-19 10:08:31,012 INFO L130 PetriNetUnfolder]: For 151418/151495 co-relation queries the response was YES. [2022-01-19 10:08:31,120 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 10:08:31,491 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 534 selfloop transitions, 134 changer transitions 45/833 dead transitions. [2022-01-19 10:08:31,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 833 transitions, 6691 flow [2022-01-19 10:08:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-19 10:08:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-19 10:08:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10122 transitions. [2022-01-19 10:08:31,513 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.506049395060494 [2022-01-19 10:08:31,513 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10122 transitions. [2022-01-19 10:08:31,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10122 transitions. [2022-01-19 10:08:31,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:08:31,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10122 transitions. [2022-01-19 10:08:31,526 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 10:08:31,539 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 10:08:31,540 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 10:08:31,540 INFO L186 Difference]: Start difference. First operand has 456 places, 420 transitions, 2514 flow. Second operand 73 states and 10122 transitions. [2022-01-19 10:08:31,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 833 transitions, 6691 flow [2022-01-19 10:08:31,848 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 10:08:31,857 INFO L242 Difference]: Finished difference. Result has 547 places, 544 transitions, 4430 flow [2022-01-19 10:08:31,858 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 10:08:31,858 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 293 predicate places. [2022-01-19 10:08:31,861 INFO L470 AbstractCegarLoop]: Abstraction has has 547 places, 544 transitions, 4430 flow [2022-01-19 10:08:31,862 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 10:08:31,862 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:08:31,862 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 10:08:31,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 10:08:31,862 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 10:08:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:08:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2136658691, now seen corresponding path program 3 times [2022-01-19 10:08:31,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:08:31,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427855000] [2022-01-19 10:08:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:08:31,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:08:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:08:52,458 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 10:08:52,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:08:52,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427855000] [2022-01-19 10:08:52,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427855000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:08:52,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:08:52,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:08:52,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813519861] [2022-01-19 10:08:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:08:52,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:08:52,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:08:52,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:08:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1982, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:08:52,463 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 10:08:52,465 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 10:08:52,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:08:52,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 10:08:52,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:09:08,207 INFO L129 PetriNetUnfolder]: 8188/20063 cut-off events. [2022-01-19 10:09:08,207 INFO L130 PetriNetUnfolder]: For 545578/545707 co-relation queries the response was YES. [2022-01-19 10:09:08,388 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 10:09:08,436 INFO L132 encePairwiseOnDemand]: 221/274 looper letters, 624 selfloop transitions, 135 changer transitions 6/897 dead transitions. [2022-01-19 10:09:08,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 897 transitions, 9013 flow [2022-01-19 10:09:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-19 10:09:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-19 10:09:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 9204 transitions. [2022-01-19 10:09:08,446 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5167883211678832 [2022-01-19 10:09:08,447 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 9204 transitions. [2022-01-19 10:09:08,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 9204 transitions. [2022-01-19 10:09:08,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:09:08,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 9204 transitions. [2022-01-19 10:09:08,463 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 10:09:08,474 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 10:09:08,476 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 10:09:08,476 INFO L186 Difference]: Start difference. First operand has 547 places, 544 transitions, 4430 flow. Second operand 65 states and 9204 transitions. [2022-01-19 10:09:08,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 897 transitions, 9013 flow [2022-01-19 10:09:09,602 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 10:09:09,611 INFO L242 Difference]: Finished difference. Result has 627 places, 624 transitions, 5191 flow [2022-01-19 10:09:09,611 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 10:09:09,612 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 373 predicate places. [2022-01-19 10:09:09,612 INFO L470 AbstractCegarLoop]: Abstraction has has 627 places, 624 transitions, 5191 flow [2022-01-19 10:09:09,613 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 10:09:09,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:09:09,613 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 10:09:09,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 10:09:09,613 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 10:09:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:09:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1185275489, now seen corresponding path program 4 times [2022-01-19 10:09:09,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:09:09,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227404613] [2022-01-19 10:09:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:09:09,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:09:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:09:28,295 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 10:09:28,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:09:28,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227404613] [2022-01-19 10:09:28,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227404613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:09:28,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:09:28,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-01-19 10:09:28,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67472070] [2022-01-19 10:09:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:09:28,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 10:09:28,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:09:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 10:09:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1889, Unknown=0, NotChecked=0, Total=2070 [2022-01-19 10:09:28,300 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 10:09:28,303 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 10:09:28,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:09:28,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 10:09:28,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:09:43,700 INFO L129 PetriNetUnfolder]: 9243/22646 cut-off events. [2022-01-19 10:09:43,701 INFO L130 PetriNetUnfolder]: For 1086912/1087089 co-relation queries the response was YES. [2022-01-19 10:09:43,959 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 10:09:44,016 INFO L132 encePairwiseOnDemand]: 221/274 looper letters, 694 selfloop transitions, 112 changer transitions 2/940 dead transitions. [2022-01-19 10:09:44,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 940 transitions, 9379 flow [2022-01-19 10:09:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 10:09:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 10:09:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 8364 transitions. [2022-01-19 10:09:44,024 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5173821600890759 [2022-01-19 10:09:44,024 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 8364 transitions. [2022-01-19 10:09:44,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 8364 transitions. [2022-01-19 10:09:44,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:09:44,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 8364 transitions. [2022-01-19 10:09:44,035 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 10:09:44,046 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 10:09:44,047 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 10:09:44,047 INFO L186 Difference]: Start difference. First operand has 627 places, 624 transitions, 5191 flow. Second operand 59 states and 8364 transitions. [2022-01-19 10:09:44,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 940 transitions, 9379 flow [2022-01-19 10:09:45,960 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 10:09:45,970 INFO L242 Difference]: Finished difference. Result has 694 places, 696 transitions, 6156 flow [2022-01-19 10:09:45,971 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 10:09:45,971 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 440 predicate places. [2022-01-19 10:09:45,971 INFO L470 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 6156 flow [2022-01-19 10:09:45,972 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 10:09:45,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:09:45,972 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 10:09:45,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 10:09:45,972 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 10:09:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:09:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1266799135, now seen corresponding path program 5 times [2022-01-19 10:09:45,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:09:45,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910212385] [2022-01-19 10:09:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:09:45,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:09:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:09:48,838 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 10:09:48,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:09:48,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910212385] [2022-01-19 10:09:48,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910212385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:09:48,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:09:48,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:09:48,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765146277] [2022-01-19 10:09:48,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:09:48,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:09:48,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:09:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:09:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1995, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:09:48,843 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:09:48,846 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 10:09:48,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:09:48,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:09:48,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:10:09,384 INFO L129 PetriNetUnfolder]: 10916/25839 cut-off events. [2022-01-19 10:10:09,384 INFO L130 PetriNetUnfolder]: For 2312903/2313058 co-relation queries the response was YES. [2022-01-19 10:10:09,741 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 10:10:09,809 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 805 selfloop transitions, 151 changer transitions 7/1083 dead transitions. [2022-01-19 10:10:09,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 1083 transitions, 11766 flow [2022-01-19 10:10:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-19 10:10:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-19 10:10:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10092 transitions. [2022-01-19 10:10:09,818 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5045495450454954 [2022-01-19 10:10:09,819 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10092 transitions. [2022-01-19 10:10:09,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10092 transitions. [2022-01-19 10:10:09,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:10:09,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10092 transitions. [2022-01-19 10:10:09,829 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 10:10:09,842 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 10:10:09,844 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 10:10:09,844 INFO L186 Difference]: Start difference. First operand has 694 places, 696 transitions, 6156 flow. Second operand 73 states and 10092 transitions. [2022-01-19 10:10:09,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 1083 transitions, 11766 flow [2022-01-19 10:10:12,868 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 10:10:12,880 INFO L242 Difference]: Finished difference. Result has 784 places, 804 transitions, 7788 flow [2022-01-19 10:10:12,881 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 10:10:12,881 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 530 predicate places. [2022-01-19 10:10:12,881 INFO L470 AbstractCegarLoop]: Abstraction has has 784 places, 804 transitions, 7788 flow [2022-01-19 10:10:12,882 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 10:10:12,882 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:10:12,882 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:12,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 10:10:12,882 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 10:10:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:10:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1722317643, now seen corresponding path program 6 times [2022-01-19 10:10:12,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:10:12,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270740386] [2022-01-19 10:10:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:10:12,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:10:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:10:15,884 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 10:10:15,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:10:15,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270740386] [2022-01-19 10:10:15,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270740386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:10:15,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:10:15,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:10:15,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535293164] [2022-01-19 10:10:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:10:15,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:10:15,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:10:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:10:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:10:15,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:10:15,891 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 10:10:15,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:10:15,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:10:15,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:10:39,772 INFO L129 PetriNetUnfolder]: 11965/28276 cut-off events. [2022-01-19 10:10:39,772 INFO L130 PetriNetUnfolder]: For 3523044/3523221 co-relation queries the response was YES. [2022-01-19 10:10:40,330 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 10:10:40,571 INFO L132 encePairwiseOnDemand]: 216/274 looper letters, 870 selfloop transitions, 212 changer transitions 11/1213 dead transitions. [2022-01-19 10:10:40,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 1213 transitions, 15256 flow [2022-01-19 10:10:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-19 10:10:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-01-19 10:10:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 10394 transitions. [2022-01-19 10:10:40,577 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5057907542579075 [2022-01-19 10:10:40,577 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 10394 transitions. [2022-01-19 10:10:40,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 10394 transitions. [2022-01-19 10:10:40,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:10:40,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 10394 transitions. [2022-01-19 10:10:40,587 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 10:10:40,600 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 10:10:40,602 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 10:10:40,602 INFO L186 Difference]: Start difference. First operand has 784 places, 804 transitions, 7788 flow. Second operand 75 states and 10394 transitions. [2022-01-19 10:10:40,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 1213 transitions, 15256 flow [2022-01-19 10:10:45,624 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 10:10:45,638 INFO L242 Difference]: Finished difference. Result has 875 places, 908 transitions, 9357 flow [2022-01-19 10:10:45,639 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 10:10:45,639 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 621 predicate places. [2022-01-19 10:10:45,639 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 908 transitions, 9357 flow [2022-01-19 10:10:45,640 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 10:10:45,640 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:10:45,640 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 10:10:45,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 10:10:45,640 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 10:10:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:10:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash 237417657, now seen corresponding path program 7 times [2022-01-19 10:10:45,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:10:45,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066918400] [2022-01-19 10:10:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:10:45,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:10:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:10:48,608 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 10:10:48,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:10:48,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066918400] [2022-01-19 10:10:48,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066918400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:10:48,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:10:48,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:10:48,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206482868] [2022-01-19 10:10:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:10:48,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:10:48,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:10:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:10:48,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1992, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:10:48,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:10:48,615 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 10:10:48,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:10:48,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:10:48,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:11:12,355 INFO L129 PetriNetUnfolder]: 13049/30808 cut-off events. [2022-01-19 10:11:12,356 INFO L130 PetriNetUnfolder]: For 5126873/5127148 co-relation queries the response was YES. [2022-01-19 10:11:13,208 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 10:11:13,315 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 972 selfloop transitions, 204 changer transitions 9/1305 dead transitions. [2022-01-19 10:11:13,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1305 transitions, 17067 flow [2022-01-19 10:11:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 10:11:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 10:11:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 10251 transitions. [2022-01-19 10:11:13,324 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5055730913395147 [2022-01-19 10:11:13,324 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 10251 transitions. [2022-01-19 10:11:13,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 10251 transitions. [2022-01-19 10:11:13,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:11:13,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 10251 transitions. [2022-01-19 10:11:13,336 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 10:11:13,352 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 10:11:13,353 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 10:11:13,353 INFO L186 Difference]: Start difference. First operand has 875 places, 908 transitions, 9357 flow. Second operand 74 states and 10251 transitions. [2022-01-19 10:11:13,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1305 transitions, 17067 flow [2022-01-19 10:11:22,217 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 10:11:22,236 INFO L242 Difference]: Finished difference. Result has 960 places, 1008 transitions, 10659 flow [2022-01-19 10:11:22,236 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 10:11:22,237 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 706 predicate places. [2022-01-19 10:11:22,237 INFO L470 AbstractCegarLoop]: Abstraction has has 960 places, 1008 transitions, 10659 flow [2022-01-19 10:11:22,238 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 10:11:22,238 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:11:22,238 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 10:11:22,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 10:11:22,238 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 10:11:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:11:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash 802123773, now seen corresponding path program 8 times [2022-01-19 10:11:22,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:11:22,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736179470] [2022-01-19 10:11:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:11:22,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:11:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:11:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:11:24,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:11:24,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736179470] [2022-01-19 10:11:24,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736179470] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:11:24,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:11:24,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:11:24,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987531715] [2022-01-19 10:11:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:11:24,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:11:24,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:11:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:11:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:11:24,897 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:11:24,899 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 10:11:24,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:11:24,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:11:24,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:11:50,647 INFO L129 PetriNetUnfolder]: 14065/33158 cut-off events. [2022-01-19 10:11:50,647 INFO L130 PetriNetUnfolder]: For 6611060/6611405 co-relation queries the response was YES. [2022-01-19 10:11:51,586 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 10:11:51,878 INFO L132 encePairwiseOnDemand]: 217/274 looper letters, 1049 selfloop transitions, 239 changer transitions 13/1421 dead transitions. [2022-01-19 10:11:51,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 1421 transitions, 20267 flow [2022-01-19 10:11:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-19 10:11:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-01-19 10:11:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 10671 transitions. [2022-01-19 10:11:51,885 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5057825386292539 [2022-01-19 10:11:51,885 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 10671 transitions. [2022-01-19 10:11:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 10671 transitions. [2022-01-19 10:11:51,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:11:51,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 10671 transitions. [2022-01-19 10:11:51,894 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 10:11:51,906 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 10:11:51,908 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 10:11:51,908 INFO L186 Difference]: Start difference. First operand has 960 places, 1008 transitions, 10659 flow. Second operand 77 states and 10671 transitions. [2022-01-19 10:11:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1036 places, 1421 transitions, 20267 flow [2022-01-19 10:12:02,586 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 10:12:02,601 INFO L242 Difference]: Finished difference. Result has 1046 places, 1105 transitions, 12033 flow [2022-01-19 10:12:02,602 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 10:12:02,602 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 792 predicate places. [2022-01-19 10:12:02,602 INFO L470 AbstractCegarLoop]: Abstraction has has 1046 places, 1105 transitions, 12033 flow [2022-01-19 10:12:02,603 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 10:12:02,603 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:12:02,603 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 10:12:02,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 10:12:02,603 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 10:12:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:12:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 182655999, now seen corresponding path program 9 times [2022-01-19 10:12:02,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:12:02,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81589731] [2022-01-19 10:12:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:12:02,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:12:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:12:05,155 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 10:12:05,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:12:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81589731] [2022-01-19 10:12:05,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81589731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:12:05,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:12:05,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 10:12:05,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981429469] [2022-01-19 10:12:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:12:05,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 10:12:05,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:12:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 10:12:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 10:12:05,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2022-01-19 10:12:05,162 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 10:12:05,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:12:05,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2022-01-19 10:12:05,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:12:33,302 INFO L129 PetriNetUnfolder]: 14881/35239 cut-off events. [2022-01-19 10:12:33,303 INFO L130 PetriNetUnfolder]: For 8370912/8371342 co-relation queries the response was YES. [2022-01-19 10:12:34,801 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 10:12:34,931 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1078 selfloop transitions, 263 changer transitions 20/1508 dead transitions. [2022-01-19 10:12:34,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1115 places, 1508 transitions, 22334 flow [2022-01-19 10:12:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-19 10:12:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-01-19 10:12:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 9548 transitions. [2022-01-19 10:12:34,938 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4978102189781022 [2022-01-19 10:12:34,938 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 9548 transitions. [2022-01-19 10:12:34,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 9548 transitions. [2022-01-19 10:12:34,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:12:34,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 9548 transitions. [2022-01-19 10:12:34,949 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 10:12:34,961 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 10:12:34,962 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 10:12:34,963 INFO L186 Difference]: Start difference. First operand has 1046 places, 1105 transitions, 12033 flow. Second operand 70 states and 9548 transitions. [2022-01-19 10:12:34,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1115 places, 1508 transitions, 22334 flow [2022-01-19 10:12:51,625 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 10:12:51,645 INFO L242 Difference]: Finished difference. Result has 1116 places, 1187 transitions, 13014 flow [2022-01-19 10:12:51,646 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 10:12:51,646 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 862 predicate places. [2022-01-19 10:12:51,646 INFO L470 AbstractCegarLoop]: Abstraction has has 1116 places, 1187 transitions, 13014 flow [2022-01-19 10:12:51,647 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 10:12:51,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:12: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 10:12:51,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 10:12:51,648 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 10:12:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:12:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1265422235, now seen corresponding path program 10 times [2022-01-19 10:12:51,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:12:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483291397] [2022-01-19 10:12:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:12:51,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:12:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:13:10,791 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 10:13:10,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:13:10,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483291397] [2022-01-19 10:13:10,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483291397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:13:10,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:13:10,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 10:13:10,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811327701] [2022-01-19 10:13:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:13:10,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 10:13:10,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:13:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 10:13:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 10:13:10,795 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 274 [2022-01-19 10:13:10,797 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 10:13:10,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:13:10,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 274 [2022-01-19 10:13:10,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:13:40,719 INFO L129 PetriNetUnfolder]: 15696/37021 cut-off events. [2022-01-19 10:13:40,720 INFO L130 PetriNetUnfolder]: For 8648233/8648598 co-relation queries the response was YES. [2022-01-19 10:13:42,427 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 10:13:42,551 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1272 selfloop transitions, 138 changer transitions 3/1534 dead transitions. [2022-01-19 10:13:42,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1178 places, 1534 transitions, 21053 flow [2022-01-19 10:13:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-19 10:13:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-19 10:13:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 8744 transitions. [2022-01-19 10:13:42,556 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5065461707797474 [2022-01-19 10:13:42,556 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 8744 transitions. [2022-01-19 10:13:42,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 8744 transitions. [2022-01-19 10:13:42,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:13:42,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 8744 transitions. [2022-01-19 10:13:42,561 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 10:13:42,569 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 10:13:42,569 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 10:13:42,570 INFO L186 Difference]: Start difference. First operand has 1116 places, 1187 transitions, 13014 flow. Second operand 63 states and 8744 transitions. [2022-01-19 10:13:42,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1178 places, 1534 transitions, 21053 flow [2022-01-19 10:13:59,686 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 10:13:59,708 INFO L242 Difference]: Finished difference. Result has 1184 places, 1266 transitions, 14025 flow [2022-01-19 10:13:59,710 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 10:13:59,710 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 930 predicate places. [2022-01-19 10:13:59,710 INFO L470 AbstractCegarLoop]: Abstraction has has 1184 places, 1266 transitions, 14025 flow [2022-01-19 10:13:59,711 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 10:13:59,711 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:13:59,712 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 10:13:59,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 10:13:59,712 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 10:13:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:13:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash -730839727, now seen corresponding path program 11 times [2022-01-19 10:13:59,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:13:59,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083589992] [2022-01-19 10:13:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:13:59,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:13:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:14:19,330 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 10:14:19,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:14:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083589992] [2022-01-19 10:14:19,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083589992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:14:19,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:14:19,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-01-19 10:14:19,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696551306] [2022-01-19 10:14:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:14:19,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-19 10:14:19,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:14:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-19 10:14:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2395, Unknown=0, NotChecked=0, Total=2550 [2022-01-19 10:14:19,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2022-01-19 10:14:19,338 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 10:14:19,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:14:19,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2022-01-19 10:14:19,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:14:53,693 INFO L129 PetriNetUnfolder]: 16406/39049 cut-off events. [2022-01-19 10:14:53,693 INFO L130 PetriNetUnfolder]: For 10193442/10193776 co-relation queries the response was YES. [2022-01-19 10:14:55,872 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 10:14:56,020 INFO L132 encePairwiseOnDemand]: 216/274 looper letters, 788 selfloop transitions, 763 changer transitions 9/1711 dead transitions. [2022-01-19 10:14:56,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1261 places, 1711 transitions, 25384 flow [2022-01-19 10:14:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-19 10:14:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-01-19 10:14:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 10581 transitions. [2022-01-19 10:14:56,027 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4950870297585626 [2022-01-19 10:14:56,027 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 10581 transitions. [2022-01-19 10:14:56,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 10581 transitions. [2022-01-19 10:14:56,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:14:56,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 10581 transitions. [2022-01-19 10:14:56,035 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 10:14:56,044 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 10:14:56,045 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 10:14:56,045 INFO L186 Difference]: Start difference. First operand has 1184 places, 1266 transitions, 14025 flow. Second operand 78 states and 10581 transitions. [2022-01-19 10:14:56,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1261 places, 1711 transitions, 25384 flow [2022-01-19 10:15:17,480 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 10:15:17,500 INFO L242 Difference]: Finished difference. Result has 1283 places, 1390 transitions, 18163 flow [2022-01-19 10:15:17,501 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 10:15:17,502 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1029 predicate places. [2022-01-19 10:15:17,502 INFO L470 AbstractCegarLoop]: Abstraction has has 1283 places, 1390 transitions, 18163 flow [2022-01-19 10:15:17,502 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 10:15:17,502 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:15:17,503 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 10:15:17,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 10:15:17,503 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 10:15:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:15:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1961893625, now seen corresponding path program 12 times [2022-01-19 10:15:17,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:15:17,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144957523] [2022-01-19 10:15:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:15:17,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:15:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:15:35,423 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 10:15:35,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:15:35,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144957523] [2022-01-19 10:15:35,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144957523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:15:35,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:15:35,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-19 10:15:35,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641428147] [2022-01-19 10:15:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:15:35,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 10:15:35,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:15:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 10:15:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 10:15:35,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 10:15:35,430 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 10:15:35,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:15:35,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 10:15:35,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:16:16,180 INFO L129 PetriNetUnfolder]: 18806/45103 cut-off events. [2022-01-19 10:16:16,181 INFO L130 PetriNetUnfolder]: For 14243187/14243595 co-relation queries the response was YES. [2022-01-19 10:16:19,185 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 10:16:19,340 INFO L132 encePairwiseOnDemand]: 219/274 looper letters, 1296 selfloop transitions, 458 changer transitions 14/1926 dead transitions. [2022-01-19 10:16:19,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1356 places, 1926 transitions, 34658 flow [2022-01-19 10:16:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 10:16:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 10:16:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 10546 transitions. [2022-01-19 10:16:19,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.520122312093115 [2022-01-19 10:16:19,346 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 10546 transitions. [2022-01-19 10:16:19,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 10546 transitions. [2022-01-19 10:16:19,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:16:19,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 10546 transitions. [2022-01-19 10:16:19,352 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 10:16:19,360 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 10:16:19,361 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 10:16:19,361 INFO L186 Difference]: Start difference. First operand has 1283 places, 1390 transitions, 18163 flow. Second operand 74 states and 10546 transitions. [2022-01-19 10:16:19,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1356 places, 1926 transitions, 34658 flow [2022-01-19 10:16:52,682 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 10:16:52,705 INFO L242 Difference]: Finished difference. Result has 1341 places, 1572 transitions, 21888 flow [2022-01-19 10:16:52,706 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 10:16:52,706 INFO L334 CegarLoopForPetriNet]: 254 programPoint places, 1087 predicate places. [2022-01-19 10:16:52,706 INFO L470 AbstractCegarLoop]: Abstraction has has 1341 places, 1572 transitions, 21888 flow [2022-01-19 10:16:52,707 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 10:16:52,707 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:16:52,707 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 10:16:52,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 10:16:52,707 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 10:16:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:16:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1473864735, now seen corresponding path program 13 times [2022-01-19 10:16:52,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:16:52,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094182025] [2022-01-19 10:16:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:16:52,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:16:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:17:12,570 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 10:17:12,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:17:12,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094182025] [2022-01-19 10:17:12,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094182025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:17:12,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:17:12,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-19 10:17:12,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334633545] [2022-01-19 10:17:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:17:12,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 10:17:12,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:17:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 10:17:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 10:17:12,575 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2022-01-19 10:17:12,577 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 10:17:12,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:17:12,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2022-01-19 10:17:12,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:17:57,202 INFO L129 PetriNetUnfolder]: 20671/49172 cut-off events. [2022-01-19 10:17:57,203 INFO L130 PetriNetUnfolder]: For 13892670/13893442 co-relation queries the response was YES. [2022-01-19 10:18:00,570 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 10:18:00,998 INFO L132 encePairwiseOnDemand]: 218/274 looper letters, 1173 selfloop transitions, 756 changer transitions 0/2087 dead transitions. [2022-01-19 10:18:00,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1416 places, 2087 transitions, 42646 flow [2022-01-19 10:18:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-19 10:18:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-01-19 10:18:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 10851 transitions. [2022-01-19 10:18:01,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5210814444871302 [2022-01-19 10:18:01,005 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 10851 transitions. [2022-01-19 10:18:01,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 10851 transitions. [2022-01-19 10:18:01,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:18:01,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 10851 transitions. [2022-01-19 10:18:01,013 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)