/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:56:18,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:56:18,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:56:18,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:56:18,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:56:18,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:56:18,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:56:18,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:56:18,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:56:18,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:56:18,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:56:18,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:56:18,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:56:18,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:56:18,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:56:18,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:56:18,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:56:18,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:56:18,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:56:18,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:56:18,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:56:18,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:56:18,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:56:18,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:56:18,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:56:18,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:56:18,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:56:18,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:56:18,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:56:18,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:56:18,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:56:18,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:56:18,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:56:18,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:56:18,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:56:18,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:56:18,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:56:18,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:56:18,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:56:18,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:56:18,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:56:18,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 06:56:18,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:56:18,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:56:18,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:56:18,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:56:18,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:56:18,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:56:18,346 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:56:18,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:56:18,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:56:18,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:56:18,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:56:18,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:56:18,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:56:18,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:56:18,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:56:18,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:56:18,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:56:18,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:56:18,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:56:18,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:56:18,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:56:18,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:56:18,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:56:18,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:56:18,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:56:18,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:56:18,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:56:18,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:56:18,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:56:18,351 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:56:18,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:56:18,352 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:56:18,353 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 06:56:18,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:56:18,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:56:18,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:56:18,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:56:18,541 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:56:18,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-01-19 06:56:18,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58df909b0/7c2e8b5a64c94f4c8c8d98969964a104/FLAGddf42e847 [2022-01-19 06:56:18,963 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:56:18,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-01-19 06:56:18,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58df909b0/7c2e8b5a64c94f4c8c8d98969964a104/FLAGddf42e847 [2022-01-19 06:56:19,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58df909b0/7c2e8b5a64c94f4c8c8d98969964a104 [2022-01-19 06:56:19,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:56:19,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:56:19,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:56:19,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:56:19,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:56:19,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675b7b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19, skipping insertion in model container [2022-01-19 06:56:19,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:56:19,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:56:19,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c[2728,2741] [2022-01-19 06:56:19,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:56:19,565 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:56:19,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c[2728,2741] [2022-01-19 06:56:19,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:56:19,618 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:56:19,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19 WrapperNode [2022-01-19 06:56:19,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:56:19,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:56:19,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:56:19,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:56:19,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,660 INFO L137 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 277 [2022-01-19 06:56:19,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:56:19,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:56:19,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:56:19,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:56:19,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:56:19,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:56:19,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:56:19,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:56:19,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (1/1) ... [2022-01-19 06:56:19,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:56:19,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:19,724 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 06:56:19,751 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 06:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 06:56:19,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 06:56:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 06:56:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 06:56:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 06:56:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 06:56:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:56:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 06:56:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:56:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:56:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:56:19,770 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 06:56:19,886 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:56:19,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:56:20,228 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:56:20,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:56:20,240 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 06:56:20,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:56:20 BoogieIcfgContainer [2022-01-19 06:56:20,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:56:20,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:56:20,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:56:20,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:56:20,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:56:19" (1/3) ... [2022-01-19 06:56:20,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be825c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:56:20, skipping insertion in model container [2022-01-19 06:56:20,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:56:19" (2/3) ... [2022-01-19 06:56:20,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be825c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:56:20, skipping insertion in model container [2022-01-19 06:56:20,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:56:20" (3/3) ... [2022-01-19 06:56:20,253 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2022-01-19 06:56:20,260 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:56:20,261 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 06:56:20,261 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:56:20,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,316 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,316 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,316 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,316 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,316 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,333 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,333 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,333 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,334 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,335 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,336 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,337 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,338 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,339 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,340 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,343 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,344 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,345 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,346 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,346 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,346 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,348 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,348 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,348 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,349 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,349 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,349 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,349 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,349 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,349 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,350 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,350 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,350 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,350 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,350 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,351 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,351 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,351 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,351 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,351 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,354 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,354 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,354 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,354 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,354 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,354 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,355 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,355 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,355 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,356 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,356 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,356 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,356 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,356 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,356 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,357 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,357 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,357 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,358 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,358 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,358 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,358 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,359 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,359 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,359 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,359 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,359 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,359 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,360 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,361 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,362 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,363 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,364 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,364 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,364 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,364 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,365 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,366 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,367 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,368 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,369 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,369 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,369 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,369 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,369 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,369 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,370 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,370 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,370 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,370 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,370 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,370 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,371 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,372 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,372 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,372 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,372 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,373 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,384 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,385 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,386 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:56:20,391 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 06:56:20,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:56:20,444 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 06:56:20,445 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:56:20,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 332 places, 350 transitions, 724 flow [2022-01-19 06:56:20,562 INFO L129 PetriNetUnfolder]: 28/347 cut-off events. [2022-01-19 06:56:20,562 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 06:56:20,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 347 events. 28/347 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 591 event pairs, 0 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 269. Up to 3 conditions per place. [2022-01-19 06:56:20,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 350 transitions, 724 flow [2022-01-19 06:56:20,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 336 transitions, 690 flow [2022-01-19 06:56:20,656 INFO L129 PetriNetUnfolder]: 27/331 cut-off events. [2022-01-19 06:56:20,656 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 06:56:20,656 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:20,657 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] [2022-01-19 06:56:20,658 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -641499725, now seen corresponding path program 1 times [2022-01-19 06:56:20,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:20,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979369706] [2022-01-19 06:56:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:20,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:20,922 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 06:56:20,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:20,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979369706] [2022-01-19 06:56:20,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979369706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:56:20,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:56:20,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:56:20,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533450065] [2022-01-19 06:56:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:20,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:56:20,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:56:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:56:20,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 350 [2022-01-19 06:56:20,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 336 transitions, 690 flow. Second operand has 2 states, 2 states have (on average 329.0) internal successors, (658), 2 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:20,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:20,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 350 [2022-01-19 06:56:20,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:21,030 INFO L129 PetriNetUnfolder]: 9/317 cut-off events. [2022-01-19 06:56:21,030 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-01-19 06:56:21,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 317 events. 9/317 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 554 event pairs, 0 based on Foata normal form. 25/320 useless extension candidates. Maximal degree in co-relation 256. Up to 7 conditions per place. [2022-01-19 06:56:21,036 INFO L132 encePairwiseOnDemand]: 331/350 looper letters, 6 selfloop transitions, 0 changer transitions 7/317 dead transitions. [2022-01-19 06:56:21,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 317 transitions, 664 flow [2022-01-19 06:56:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:56:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:56:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 673 transitions. [2022-01-19 06:56:21,053 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9614285714285714 [2022-01-19 06:56:21,054 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 673 transitions. [2022-01-19 06:56:21,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 673 transitions. [2022-01-19 06:56:21,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:21,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 673 transitions. [2022-01-19 06:56:21,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 336.5) internal successors, (673), 2 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:21,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:21,078 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:21,079 INFO L186 Difference]: Start difference. First operand has 318 places, 336 transitions, 690 flow. Second operand 2 states and 673 transitions. [2022-01-19 06:56:21,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 317 transitions, 664 flow [2022-01-19 06:56:21,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 317 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 06:56:21,093 INFO L242 Difference]: Finished difference. Result has 313 places, 310 transitions, 626 flow [2022-01-19 06:56:21,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=626, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2022-01-19 06:56:21,101 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, -5 predicate places. [2022-01-19 06:56:21,101 INFO L470 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 626 flow [2022-01-19 06:56:21,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 329.0) internal successors, (658), 2 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:21,103 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:21,103 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] [2022-01-19 06:56:21,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:56:21,104 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -330795675, now seen corresponding path program 1 times [2022-01-19 06:56:21,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:21,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955771227] [2022-01-19 06:56:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:21,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:21,571 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 06:56:21,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955771227] [2022-01-19 06:56:21,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955771227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:56:21,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:56:21,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 06:56:21,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146008087] [2022-01-19 06:56:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:21,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:56:21,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:21,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:56:21,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:56:21,584 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 350 [2022-01-19 06:56:21,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 626 flow. Second operand has 14 states, 14 states have (on average 248.5) internal successors, (3479), 14 states have internal predecessors, (3479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:21,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:21,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 350 [2022-01-19 06:56:21,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:22,874 INFO L129 PetriNetUnfolder]: 535/4795 cut-off events. [2022-01-19 06:56:22,875 INFO L130 PetriNetUnfolder]: For 63/72 co-relation queries the response was YES. [2022-01-19 06:56:22,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 4795 events. 535/4795 cut-off events. For 63/72 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 48004 event pairs, 282 based on Foata normal form. 1/4297 useless extension candidates. Maximal degree in co-relation 5592. Up to 265 conditions per place. [2022-01-19 06:56:22,910 INFO L132 encePairwiseOnDemand]: 328/350 looper letters, 135 selfloop transitions, 21 changer transitions 6/393 dead transitions. [2022-01-19 06:56:22,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 393 transitions, 1129 flow [2022-01-19 06:56:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 06:56:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 06:56:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 5043 transitions. [2022-01-19 06:56:22,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7204285714285714 [2022-01-19 06:56:22,921 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 5043 transitions. [2022-01-19 06:56:22,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 5043 transitions. [2022-01-19 06:56:22,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:22,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 5043 transitions. [2022-01-19 06:56:22,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 252.15) internal successors, (5043), 20 states have internal predecessors, (5043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:22,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 350.0) internal successors, (7350), 21 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:22,950 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 350.0) internal successors, (7350), 21 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:22,950 INFO L186 Difference]: Start difference. First operand has 313 places, 310 transitions, 626 flow. Second operand 20 states and 5043 transitions. [2022-01-19 06:56:22,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 393 transitions, 1129 flow [2022-01-19 06:56:22,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 393 transitions, 1129 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:56:22,960 INFO L242 Difference]: Finished difference. Result has 336 places, 322 transitions, 743 flow [2022-01-19 06:56:22,961 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=743, PETRI_PLACES=336, PETRI_TRANSITIONS=322} [2022-01-19 06:56:22,961 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 18 predicate places. [2022-01-19 06:56:22,962 INFO L470 AbstractCegarLoop]: Abstraction has has 336 places, 322 transitions, 743 flow [2022-01-19 06:56:22,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 248.5) internal successors, (3479), 14 states have internal predecessors, (3479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:22,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:22,965 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] [2022-01-19 06:56:22,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:56:22,965 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1220409415, now seen corresponding path program 1 times [2022-01-19 06:56:22,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:22,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751263940] [2022-01-19 06:56:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:22,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:56:23,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:23,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751263940] [2022-01-19 06:56:23,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751263940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:56:23,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:56:23,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 06:56:23,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182941761] [2022-01-19 06:56:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:23,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:56:23,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:56:23,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:56:23,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 350 [2022-01-19 06:56:23,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 322 transitions, 743 flow. Second operand has 14 states, 14 states have (on average 248.78571428571428) internal successors, (3483), 14 states have internal predecessors, (3483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:23,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:23,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 350 [2022-01-19 06:56:23,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:25,190 INFO L129 PetriNetUnfolder]: 1102/9683 cut-off events. [2022-01-19 06:56:25,190 INFO L130 PetriNetUnfolder]: For 312/317 co-relation queries the response was YES. [2022-01-19 06:56:25,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11567 conditions, 9683 events. 1102/9683 cut-off events. For 312/317 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 112982 event pairs, 513 based on Foata normal form. 3/8653 useless extension candidates. Maximal degree in co-relation 11552. Up to 573 conditions per place. [2022-01-19 06:56:25,262 INFO L132 encePairwiseOnDemand]: 330/350 looper letters, 129 selfloop transitions, 25 changer transitions 5/391 dead transitions. [2022-01-19 06:56:25,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 391 transitions, 1248 flow [2022-01-19 06:56:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:56:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:56:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4780 transitions. [2022-01-19 06:56:25,271 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.718796992481203 [2022-01-19 06:56:25,272 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4780 transitions. [2022-01-19 06:56:25,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4780 transitions. [2022-01-19 06:56:25,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:25,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4780 transitions. [2022-01-19 06:56:25,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 251.57894736842104) internal successors, (4780), 19 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 06:56:25,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:25,293 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:25,293 INFO L186 Difference]: Start difference. First operand has 336 places, 322 transitions, 743 flow. Second operand 19 states and 4780 transitions. [2022-01-19 06:56:25,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 391 transitions, 1248 flow [2022-01-19 06:56:25,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 391 transitions, 1229 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-01-19 06:56:25,304 INFO L242 Difference]: Finished difference. Result has 356 places, 334 transitions, 863 flow [2022-01-19 06:56:25,304 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=863, PETRI_PLACES=356, PETRI_TRANSITIONS=334} [2022-01-19 06:56:25,306 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 38 predicate places. [2022-01-19 06:56:25,306 INFO L470 AbstractCegarLoop]: Abstraction has has 356 places, 334 transitions, 863 flow [2022-01-19 06:56:25,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 248.78571428571428) internal successors, (3483), 14 states have internal predecessors, (3483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:25,308 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:25,308 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] [2022-01-19 06:56:25,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 06:56:25,308 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:25,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 45808441, now seen corresponding path program 1 times [2022-01-19 06:56:25,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:25,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680154820] [2022-01-19 06:56:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:25,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:56:25,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:25,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680154820] [2022-01-19 06:56:25,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680154820] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:25,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493423441] [2022-01-19 06:56:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:25,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:25,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:25,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:56:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:25,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 06:56:25,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:56:26,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:56:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:56:27,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493423441] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:27,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 06:56:27,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2022-01-19 06:56:27,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213794239] [2022-01-19 06:56:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:27,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 06:56:27,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 06:56:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:56:27,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 350 [2022-01-19 06:56:27,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 334 transitions, 863 flow. Second operand has 11 states, 11 states have (on average 272.45454545454544) internal successors, (2997), 11 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:27,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:27,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 350 [2022-01-19 06:56:27,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:29,264 INFO L129 PetriNetUnfolder]: 1877/13204 cut-off events. [2022-01-19 06:56:29,264 INFO L130 PetriNetUnfolder]: For 595/595 co-relation queries the response was YES. [2022-01-19 06:56:29,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17049 conditions, 13204 events. 1877/13204 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 165723 event pairs, 610 based on Foata normal form. 0/11822 useless extension candidates. Maximal degree in co-relation 17027. Up to 740 conditions per place. [2022-01-19 06:56:29,352 INFO L132 encePairwiseOnDemand]: 332/350 looper letters, 159 selfloop transitions, 28 changer transitions 3/444 dead transitions. [2022-01-19 06:56:29,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 444 transitions, 1532 flow [2022-01-19 06:56:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:56:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:56:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5273 transitions. [2022-01-19 06:56:29,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7929323308270677 [2022-01-19 06:56:29,362 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5273 transitions. [2022-01-19 06:56:29,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5273 transitions. [2022-01-19 06:56:29,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:29,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5273 transitions. [2022-01-19 06:56:29,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 277.5263157894737) internal successors, (5273), 19 states have internal predecessors, (5273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:29,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:29,385 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:29,385 INFO L186 Difference]: Start difference. First operand has 356 places, 334 transitions, 863 flow. Second operand 19 states and 5273 transitions. [2022-01-19 06:56:29,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 444 transitions, 1532 flow [2022-01-19 06:56:29,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 444 transitions, 1515 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-01-19 06:56:29,395 INFO L242 Difference]: Finished difference. Result has 372 places, 347 transitions, 979 flow [2022-01-19 06:56:29,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=979, PETRI_PLACES=372, PETRI_TRANSITIONS=347} [2022-01-19 06:56:29,397 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 54 predicate places. [2022-01-19 06:56:29,397 INFO L470 AbstractCegarLoop]: Abstraction has has 372 places, 347 transitions, 979 flow [2022-01-19 06:56:29,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.45454545454544) internal successors, (2997), 11 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:29,404 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:29,404 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] [2022-01-19 06:56:29,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 06:56:29,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:29,622 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2124156704, now seen corresponding path program 1 times [2022-01-19 06:56:29,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:29,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239349352] [2022-01-19 06:56:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:29,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 06:56:29,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:29,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239349352] [2022-01-19 06:56:29,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239349352] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:29,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444803106] [2022-01-19 06:56:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:29,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:29,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:29,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 06:56:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:29,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 06:56:29,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 06:56:30,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:56:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 06:56:31,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444803106] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:31,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 06:56:31,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 25 [2022-01-19 06:56:31,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140793075] [2022-01-19 06:56:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:31,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 06:56:31,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:31,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 06:56:31,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-01-19 06:56:31,050 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 350 [2022-01-19 06:56:31,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 347 transitions, 979 flow. Second operand has 13 states, 13 states have (on average 249.53846153846155) internal successors, (3244), 13 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:31,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:31,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 350 [2022-01-19 06:56:31,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:33,300 INFO L129 PetriNetUnfolder]: 1715/15095 cut-off events. [2022-01-19 06:56:33,300 INFO L130 PetriNetUnfolder]: For 1336/1340 co-relation queries the response was YES. [2022-01-19 06:56:33,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18865 conditions, 15095 events. 1715/15095 cut-off events. For 1336/1340 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 187374 event pairs, 990 based on Foata normal form. 8/13583 useless extension candidates. Maximal degree in co-relation 18840. Up to 793 conditions per place. [2022-01-19 06:56:33,389 INFO L132 encePairwiseOnDemand]: 328/350 looper letters, 163 selfloop transitions, 34 changer transitions 4/437 dead transitions. [2022-01-19 06:56:33,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 437 transitions, 1661 flow [2022-01-19 06:56:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:56:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 06:56:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4320 transitions. [2022-01-19 06:56:33,398 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7260504201680672 [2022-01-19 06:56:33,398 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4320 transitions. [2022-01-19 06:56:33,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4320 transitions. [2022-01-19 06:56:33,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:33,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4320 transitions. [2022-01-19 06:56:33,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 254.11764705882354) internal successors, (4320), 17 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:33,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 350.0) internal successors, (6300), 18 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:33,415 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 350.0) internal successors, (6300), 18 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:33,416 INFO L186 Difference]: Start difference. First operand has 372 places, 347 transitions, 979 flow. Second operand 17 states and 4320 transitions. [2022-01-19 06:56:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 437 transitions, 1661 flow [2022-01-19 06:56:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 437 transitions, 1639 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-01-19 06:56:33,426 INFO L242 Difference]: Finished difference. Result has 388 places, 360 transitions, 1110 flow [2022-01-19 06:56:33,427 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1110, PETRI_PLACES=388, PETRI_TRANSITIONS=360} [2022-01-19 06:56:33,427 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 70 predicate places. [2022-01-19 06:56:33,428 INFO L470 AbstractCegarLoop]: Abstraction has has 388 places, 360 transitions, 1110 flow [2022-01-19 06:56:33,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 249.53846153846155) internal successors, (3244), 13 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:33,429 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:33,429 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 06:56:33,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:56:33,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:33,652 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 422050291, now seen corresponding path program 1 times [2022-01-19 06:56:33,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237958401] [2022-01-19 06:56:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:33,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 06:56:33,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237958401] [2022-01-19 06:56:33,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237958401] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089964472] [2022-01-19 06:56:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:33,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:33,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:33,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 06:56:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:33,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 06:56:33,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 06:56:34,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:56:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 06:56:35,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089964472] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:35,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 06:56:35,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 29 [2022-01-19 06:56:35,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505363133] [2022-01-19 06:56:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:35,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 06:56:35,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 06:56:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2022-01-19 06:56:35,291 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 350 [2022-01-19 06:56:35,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 360 transitions, 1110 flow. Second operand has 11 states, 11 states have (on average 272.90909090909093) internal successors, (3002), 11 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:35,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:35,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 350 [2022-01-19 06:56:35,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:37,853 INFO L129 PetriNetUnfolder]: 3153/17583 cut-off events. [2022-01-19 06:56:37,853 INFO L130 PetriNetUnfolder]: For 2807/2984 co-relation queries the response was YES. [2022-01-19 06:56:37,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25061 conditions, 17583 events. 3153/17583 cut-off events. For 2807/2984 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 216097 event pairs, 1188 based on Foata normal form. 40/15697 useless extension candidates. Maximal degree in co-relation 25029. Up to 1180 conditions per place. [2022-01-19 06:56:38,091 INFO L132 encePairwiseOnDemand]: 332/350 looper letters, 160 selfloop transitions, 31 changer transitions 1/450 dead transitions. [2022-01-19 06:56:38,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 450 transitions, 1767 flow [2022-01-19 06:56:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 06:56:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 06:56:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4987 transitions. [2022-01-19 06:56:38,110 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7915873015873016 [2022-01-19 06:56:38,110 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4987 transitions. [2022-01-19 06:56:38,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4987 transitions. [2022-01-19 06:56:38,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:38,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4987 transitions. [2022-01-19 06:56:38,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 277.05555555555554) internal successors, (4987), 18 states have internal predecessors, (4987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:38,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 350.0) internal successors, (6650), 19 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:38,129 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 350.0) internal successors, (6650), 19 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:38,129 INFO L186 Difference]: Start difference. First operand has 388 places, 360 transitions, 1110 flow. Second operand 18 states and 4987 transitions. [2022-01-19 06:56:38,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 450 transitions, 1767 flow [2022-01-19 06:56:38,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 450 transitions, 1730 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-01-19 06:56:38,146 INFO L242 Difference]: Finished difference. Result has 395 places, 366 transitions, 1160 flow [2022-01-19 06:56:38,147 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1160, PETRI_PLACES=395, PETRI_TRANSITIONS=366} [2022-01-19 06:56:38,149 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 77 predicate places. [2022-01-19 06:56:38,149 INFO L470 AbstractCegarLoop]: Abstraction has has 395 places, 366 transitions, 1160 flow [2022-01-19 06:56:38,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 272.90909090909093) internal successors, (3002), 11 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:38,150 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:38,150 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 06:56:38,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:56:38,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:38,369 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash 768654560, now seen corresponding path program 1 times [2022-01-19 06:56:38,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:38,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875135482] [2022-01-19 06:56:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:38,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:56:38,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875135482] [2022-01-19 06:56:38,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875135482] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770020615] [2022-01-19 06:56:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:38,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:38,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:38,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 06:56:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:38,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 06:56:38,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:56:39,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:56:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:56:39,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770020615] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:39,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 06:56:39,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 23 [2022-01-19 06:56:39,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819390674] [2022-01-19 06:56:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:39,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 06:56:39,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 06:56:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:56:39,772 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 350 [2022-01-19 06:56:39,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 366 transitions, 1160 flow. Second operand has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:39,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:39,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 350 [2022-01-19 06:56:39,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:44,319 INFO L129 PetriNetUnfolder]: 4107/35831 cut-off events. [2022-01-19 06:56:44,319 INFO L130 PetriNetUnfolder]: For 4813/5629 co-relation queries the response was YES. [2022-01-19 06:56:44,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47788 conditions, 35831 events. 4107/35831 cut-off events. For 4813/5629 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 536921 event pairs, 2347 based on Foata normal form. 65/33106 useless extension candidates. Maximal degree in co-relation 47758. Up to 1406 conditions per place. [2022-01-19 06:56:44,718 INFO L132 encePairwiseOnDemand]: 333/350 looper letters, 176 selfloop transitions, 40 changer transitions 2/479 dead transitions. [2022-01-19 06:56:44,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 479 transitions, 2013 flow [2022-01-19 06:56:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:56:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:56:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5246 transitions. [2022-01-19 06:56:44,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7888721804511278 [2022-01-19 06:56:44,726 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5246 transitions. [2022-01-19 06:56:44,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5246 transitions. [2022-01-19 06:56:44,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:44,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5246 transitions. [2022-01-19 06:56:44,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 276.10526315789474) internal successors, (5246), 19 states have internal predecessors, (5246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:44,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:44,744 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 350.0) internal successors, (7000), 20 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:44,744 INFO L186 Difference]: Start difference. First operand has 395 places, 366 transitions, 1160 flow. Second operand 19 states and 5246 transitions. [2022-01-19 06:56:44,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 479 transitions, 2013 flow [2022-01-19 06:56:44,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 479 transitions, 1970 flow, removed 3 selfloop flow, removed 9 redundant places. [2022-01-19 06:56:44,781 INFO L242 Difference]: Finished difference. Result has 410 places, 378 transitions, 1294 flow [2022-01-19 06:56:44,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1294, PETRI_PLACES=410, PETRI_TRANSITIONS=378} [2022-01-19 06:56:44,782 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 92 predicate places. [2022-01-19 06:56:44,782 INFO L470 AbstractCegarLoop]: Abstraction has has 410 places, 378 transitions, 1294 flow [2022-01-19 06:56:44,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:44,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:44,783 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, 1] [2022-01-19 06:56:44,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 06:56:44,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:45,000 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2068639532, now seen corresponding path program 1 times [2022-01-19 06:56:45,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:45,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210884432] [2022-01-19 06:56:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:45,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:56:45,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210884432] [2022-01-19 06:56:45,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210884432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:56:45,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:56:45,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:56:45,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428102993] [2022-01-19 06:56:45,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:45,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:56:45,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:45,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:56:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:56:45,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2022-01-19 06:56:45,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 378 transitions, 1294 flow. Second operand has 7 states, 7 states have (on average 279.42857142857144) internal successors, (1956), 7 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:45,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:45,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2022-01-19 06:56:45,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:46,075 INFO L129 PetriNetUnfolder]: 465/6643 cut-off events. [2022-01-19 06:56:46,075 INFO L130 PetriNetUnfolder]: For 1247/1927 co-relation queries the response was YES. [2022-01-19 06:56:46,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9016 conditions, 6643 events. 465/6643 cut-off events. For 1247/1927 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 69698 event pairs, 329 based on Foata normal form. 18/6194 useless extension candidates. Maximal degree in co-relation 8982. Up to 756 conditions per place. [2022-01-19 06:56:46,127 INFO L132 encePairwiseOnDemand]: 339/350 looper letters, 73 selfloop transitions, 8 changer transitions 55/402 dead transitions. [2022-01-19 06:56:46,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 402 transitions, 1629 flow [2022-01-19 06:56:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 06:56:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 06:56:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2834 transitions. [2022-01-19 06:56:46,131 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8097142857142857 [2022-01-19 06:56:46,131 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2834 transitions. [2022-01-19 06:56:46,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2834 transitions. [2022-01-19 06:56:46,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:46,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2834 transitions. [2022-01-19 06:56:46,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 283.4) internal successors, (2834), 10 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:46,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:46,139 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:46,139 INFO L186 Difference]: Start difference. First operand has 410 places, 378 transitions, 1294 flow. Second operand 10 states and 2834 transitions. [2022-01-19 06:56:46,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 402 transitions, 1629 flow [2022-01-19 06:56:46,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 402 transitions, 1569 flow, removed 3 selfloop flow, removed 11 redundant places. [2022-01-19 06:56:46,150 INFO L242 Difference]: Finished difference. Result has 407 places, 345 transitions, 1051 flow [2022-01-19 06:56:46,151 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1051, PETRI_PLACES=407, PETRI_TRANSITIONS=345} [2022-01-19 06:56:46,151 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 89 predicate places. [2022-01-19 06:56:46,151 INFO L470 AbstractCegarLoop]: Abstraction has has 407 places, 345 transitions, 1051 flow [2022-01-19 06:56:46,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 279.42857142857144) internal successors, (1956), 7 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:46,152 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:46,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:56:46,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 06:56:46,152 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash -840269741, now seen corresponding path program 1 times [2022-01-19 06:56:46,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:46,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097289085] [2022-01-19 06:56:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:46,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:56:46,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:46,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097289085] [2022-01-19 06:56:46,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097289085] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:46,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625579260] [2022-01-19 06:56:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:46,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:46,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:46,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:46,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 06:56:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:46,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:56:46,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:56:46,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:56:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:56:47,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625579260] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:56:47,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:56:47,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 31 [2022-01-19 06:56:47,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987258214] [2022-01-19 06:56:47,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:56:47,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-19 06:56:47,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-19 06:56:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-01-19 06:56:47,446 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 350 [2022-01-19 06:56:47,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 345 transitions, 1051 flow. Second operand has 31 states, 31 states have (on average 245.67741935483872) internal successors, (7616), 31 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:47,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:47,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 350 [2022-01-19 06:56:47,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:51,082 INFO L129 PetriNetUnfolder]: 2269/20855 cut-off events. [2022-01-19 06:56:51,083 INFO L130 PetriNetUnfolder]: For 4685/4856 co-relation queries the response was YES. [2022-01-19 06:56:51,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29308 conditions, 20855 events. 2269/20855 cut-off events. For 4685/4856 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 282716 event pairs, 948 based on Foata normal form. 143/19489 useless extension candidates. Maximal degree in co-relation 29273. Up to 800 conditions per place. [2022-01-19 06:56:51,208 INFO L132 encePairwiseOnDemand]: 321/350 looper letters, 216 selfloop transitions, 51 changer transitions 10/513 dead transitions. [2022-01-19 06:56:51,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 513 transitions, 2298 flow [2022-01-19 06:56:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 06:56:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 06:56:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 9146 transitions. [2022-01-19 06:56:51,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7062548262548263 [2022-01-19 06:56:51,217 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 9146 transitions. [2022-01-19 06:56:51,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 9146 transitions. [2022-01-19 06:56:51,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:51,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 9146 transitions. [2022-01-19 06:56:51,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 247.1891891891892) internal successors, (9146), 37 states have internal predecessors, (9146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:51,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 350.0) internal successors, (13300), 38 states have internal predecessors, (13300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:51,244 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 350.0) internal successors, (13300), 38 states have internal predecessors, (13300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:51,244 INFO L186 Difference]: Start difference. First operand has 407 places, 345 transitions, 1051 flow. Second operand 37 states and 9146 transitions. [2022-01-19 06:56:51,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 513 transitions, 2298 flow [2022-01-19 06:56:51,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 513 transitions, 2148 flow, removed 10 selfloop flow, removed 30 redundant places. [2022-01-19 06:56:51,262 INFO L242 Difference]: Finished difference. Result has 415 places, 371 transitions, 1280 flow [2022-01-19 06:56:51,263 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1280, PETRI_PLACES=415, PETRI_TRANSITIONS=371} [2022-01-19 06:56:51,263 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 97 predicate places. [2022-01-19 06:56:51,264 INFO L470 AbstractCegarLoop]: Abstraction has has 415 places, 371 transitions, 1280 flow [2022-01-19 06:56:51,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 245.67741935483872) internal successors, (7616), 31 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:51,265 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:51,265 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:51,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:56:51,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:51,484 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1559230401, now seen corresponding path program 2 times [2022-01-19 06:56:51,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:51,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285235309] [2022-01-19 06:56:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:51,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:56:51,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285235309] [2022-01-19 06:56:51,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285235309] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986850563] [2022-01-19 06:56:51,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:56:51,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:51,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:51,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 06:56:51,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 06:56:51,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:56:51,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:56:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-19 06:56:52,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:56:52,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986850563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:56:52,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:56:52,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 20 [2022-01-19 06:56:52,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624477101] [2022-01-19 06:56:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:52,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:56:52,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:56:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-01-19 06:56:52,327 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 350 [2022-01-19 06:56:52,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 371 transitions, 1280 flow. Second operand has 7 states, 7 states have (on average 272.85714285714283) internal successors, (1910), 7 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:52,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:52,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 350 [2022-01-19 06:56:52,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:57,586 INFO L129 PetriNetUnfolder]: 5214/38199 cut-off events. [2022-01-19 06:56:57,586 INFO L130 PetriNetUnfolder]: For 11926/12122 co-relation queries the response was YES. [2022-01-19 06:56:57,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56945 conditions, 38199 events. 5214/38199 cut-off events. For 11926/12122 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 557920 event pairs, 1040 based on Foata normal form. 197/35081 useless extension candidates. Maximal degree in co-relation 56906. Up to 2909 conditions per place. [2022-01-19 06:56:57,905 INFO L132 encePairwiseOnDemand]: 341/350 looper letters, 146 selfloop transitions, 22 changer transitions 4/462 dead transitions. [2022-01-19 06:56:57,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 462 transitions, 2109 flow [2022-01-19 06:56:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:56:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:56:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1961 transitions. [2022-01-19 06:56:57,908 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8004081632653062 [2022-01-19 06:56:57,908 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1961 transitions. [2022-01-19 06:56:57,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1961 transitions. [2022-01-19 06:56:57,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:57,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1961 transitions. [2022-01-19 06:56:57,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:57,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:57,913 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:57,913 INFO L186 Difference]: Start difference. First operand has 415 places, 371 transitions, 1280 flow. Second operand 7 states and 1961 transitions. [2022-01-19 06:56:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 462 transitions, 2109 flow [2022-01-19 06:56:57,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 462 transitions, 2046 flow, removed 19 selfloop flow, removed 14 redundant places. [2022-01-19 06:56:57,943 INFO L242 Difference]: Finished difference. Result has 408 places, 389 transitions, 1457 flow [2022-01-19 06:56:57,944 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1457, PETRI_PLACES=408, PETRI_TRANSITIONS=389} [2022-01-19 06:56:57,944 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 90 predicate places. [2022-01-19 06:56:57,944 INFO L470 AbstractCegarLoop]: Abstraction has has 408 places, 389 transitions, 1457 flow [2022-01-19 06:56:57,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 272.85714285714283) internal successors, (1910), 7 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:57,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:57,945 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:57,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 06:56:58,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:58,152 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:56:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash -952694905, now seen corresponding path program 3 times [2022-01-19 06:56:58,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:58,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587905197] [2022-01-19 06:56:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:58,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:56:58,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:58,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587905197] [2022-01-19 06:56:58,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587905197] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:58,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468338040] [2022-01-19 06:56:58,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:56:58,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:58,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:56:58,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 06:56:58,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-19 06:56:58,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:56:58,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:56:58,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-19 06:56:58,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:56:58,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468338040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:56:58,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:56:58,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 20 [2022-01-19 06:56:58,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471624349] [2022-01-19 06:56:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:56:58,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:56:58,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:56:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:56:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-01-19 06:56:58,764 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 350 [2022-01-19 06:56:58,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 389 transitions, 1457 flow. Second operand has 7 states, 7 states have (on average 272.85714285714283) internal successors, (1910), 7 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:58,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:56:58,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 350 [2022-01-19 06:56:58,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:57:06,283 INFO L129 PetriNetUnfolder]: 7336/52545 cut-off events. [2022-01-19 06:57:06,284 INFO L130 PetriNetUnfolder]: For 28599/30731 co-relation queries the response was YES. [2022-01-19 06:57:06,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83392 conditions, 52545 events. 7336/52545 cut-off events. For 28599/30731 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 823275 event pairs, 1560 based on Foata normal form. 528/48541 useless extension candidates. Maximal degree in co-relation 83353. Up to 4719 conditions per place. [2022-01-19 06:57:06,817 INFO L132 encePairwiseOnDemand]: 341/350 looper letters, 149 selfloop transitions, 39 changer transitions 4/482 dead transitions. [2022-01-19 06:57:06,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 482 transitions, 2406 flow [2022-01-19 06:57:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:57:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:57:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1964 transitions. [2022-01-19 06:57:06,819 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8016326530612244 [2022-01-19 06:57:06,819 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1964 transitions. [2022-01-19 06:57:06,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1964 transitions. [2022-01-19 06:57:06,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:57:06,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1964 transitions. [2022-01-19 06:57:06,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 280.57142857142856) internal successors, (1964), 7 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:06,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:06,824 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:06,824 INFO L186 Difference]: Start difference. First operand has 408 places, 389 transitions, 1457 flow. Second operand 7 states and 1964 transitions. [2022-01-19 06:57:06,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 482 transitions, 2406 flow [2022-01-19 06:57:06,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 482 transitions, 2374 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-01-19 06:57:06,877 INFO L242 Difference]: Finished difference. Result has 414 places, 412 transitions, 1841 flow [2022-01-19 06:57:06,877 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1841, PETRI_PLACES=414, PETRI_TRANSITIONS=412} [2022-01-19 06:57:06,878 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 96 predicate places. [2022-01-19 06:57:06,878 INFO L470 AbstractCegarLoop]: Abstraction has has 414 places, 412 transitions, 1841 flow [2022-01-19 06:57:06,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 272.85714285714283) internal successors, (1910), 7 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:06,878 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:57:06,878 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:06,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:57:07,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:57:07,088 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:57:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:57:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1827023955, now seen corresponding path program 4 times [2022-01-19 06:57:07,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:57:07,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118273578] [2022-01-19 06:57:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:57:07,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:57:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:57:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:57:07,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:57:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118273578] [2022-01-19 06:57:07,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118273578] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:57:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318056618] [2022-01-19 06:57:07,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 06:57:07,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:57:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:57:07,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:57:07,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:57:07,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 06:57:07,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:57:07,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:57:07,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:57:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:57:08,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:57:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:57:08,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318056618] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:57:08,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:57:08,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 40 [2022-01-19 06:57:08,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545888045] [2022-01-19 06:57:08,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:57:08,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 06:57:08,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:57:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 06:57:08,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 06:57:08,829 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 350 [2022-01-19 06:57:08,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 412 transitions, 1841 flow. Second operand has 40 states, 40 states have (on average 242.6) internal successors, (9704), 40 states have internal predecessors, (9704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:08,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:57:08,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 350 [2022-01-19 06:57:08,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:57:36,875 INFO L129 PetriNetUnfolder]: 21974/160133 cut-off events. [2022-01-19 06:57:36,876 INFO L130 PetriNetUnfolder]: For 141751/152050 co-relation queries the response was YES. [2022-01-19 06:57:38,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265430 conditions, 160133 events. 21974/160133 cut-off events. For 141751/152050 co-relation queries the response was YES. Maximal size of possible extension queue 3562. Compared 2967304 event pairs, 9165 based on Foata normal form. 1457/147745 useless extension candidates. Maximal degree in co-relation 265388. Up to 10268 conditions per place. [2022-01-19 06:57:39,327 INFO L132 encePairwiseOnDemand]: 320/350 looper letters, 658 selfloop transitions, 147 changer transitions 12/1048 dead transitions. [2022-01-19 06:57:39,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 1048 transitions, 8120 flow [2022-01-19 06:57:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-01-19 06:57:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-01-19 06:57:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 17516 transitions. [2022-01-19 06:57:39,339 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6950793650793651 [2022-01-19 06:57:39,339 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 17516 transitions. [2022-01-19 06:57:39,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 17516 transitions. [2022-01-19 06:57:39,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:57:39,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 17516 transitions. [2022-01-19 06:57:39,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 243.27777777777777) internal successors, (17516), 72 states have internal predecessors, (17516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:39,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 350.0) internal successors, (25550), 73 states have internal predecessors, (25550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:39,386 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 350.0) internal successors, (25550), 73 states have internal predecessors, (25550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:39,386 INFO L186 Difference]: Start difference. First operand has 414 places, 412 transitions, 1841 flow. Second operand 72 states and 17516 transitions. [2022-01-19 06:57:39,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 1048 transitions, 8120 flow [2022-01-19 06:57:39,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 1048 transitions, 7972 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-01-19 06:57:39,786 INFO L242 Difference]: Finished difference. Result has 495 places, 525 transitions, 3088 flow [2022-01-19 06:57:39,787 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=3088, PETRI_PLACES=495, PETRI_TRANSITIONS=525} [2022-01-19 06:57:39,787 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 177 predicate places. [2022-01-19 06:57:39,787 INFO L470 AbstractCegarLoop]: Abstraction has has 495 places, 525 transitions, 3088 flow [2022-01-19 06:57:39,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 242.6) internal successors, (9704), 40 states have internal predecessors, (9704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:39,789 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:57:39,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:57:39,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:57:40,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 06:57:40,003 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:57:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:57:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1731982178, now seen corresponding path program 1 times [2022-01-19 06:57:40,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:57:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283296569] [2022-01-19 06:57:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:57:40,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:57:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:57:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:57:40,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:57:40,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283296569] [2022-01-19 06:57:40,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283296569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:57:40,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:57:40,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:57:40,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654692356] [2022-01-19 06:57:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:57:40,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:57:40,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:57:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:57:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:57:40,077 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2022-01-19 06:57:40,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 525 transitions, 3088 flow. Second operand has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:40,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:57:40,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2022-01-19 06:57:40,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:57:53,918 INFO L129 PetriNetUnfolder]: 10156/72514 cut-off events. [2022-01-19 06:57:53,918 INFO L130 PetriNetUnfolder]: For 53195/54915 co-relation queries the response was YES. [2022-01-19 06:57:55,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122022 conditions, 72514 events. 10156/72514 cut-off events. For 53195/54915 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 1189859 event pairs, 6076 based on Foata normal form. 907/66943 useless extension candidates. Maximal degree in co-relation 121967. Up to 13972 conditions per place. [2022-01-19 06:57:55,540 INFO L132 encePairwiseOnDemand]: 339/350 looper letters, 144 selfloop transitions, 25 changer transitions 77/550 dead transitions. [2022-01-19 06:57:55,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 550 transitions, 3656 flow [2022-01-19 06:57:55,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 06:57:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 06:57:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2822 transitions. [2022-01-19 06:57:55,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8062857142857143 [2022-01-19 06:57:55,543 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2822 transitions. [2022-01-19 06:57:55,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2822 transitions. [2022-01-19 06:57:55,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:57:55,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2822 transitions. [2022-01-19 06:57:55,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 282.2) internal successors, (2822), 10 states have internal predecessors, (2822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:55,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:55,550 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 350.0) internal successors, (3850), 11 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:55,550 INFO L186 Difference]: Start difference. First operand has 495 places, 525 transitions, 3088 flow. Second operand 10 states and 2822 transitions. [2022-01-19 06:57:55,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 550 transitions, 3656 flow [2022-01-19 06:57:55,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 550 transitions, 3547 flow, removed 45 selfloop flow, removed 11 redundant places. [2022-01-19 06:57:55,746 INFO L242 Difference]: Finished difference. Result has 486 places, 472 transitions, 2494 flow [2022-01-19 06:57:55,746 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2807, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2494, PETRI_PLACES=486, PETRI_TRANSITIONS=472} [2022-01-19 06:57:55,747 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 168 predicate places. [2022-01-19 06:57:55,747 INFO L470 AbstractCegarLoop]: Abstraction has has 486 places, 472 transitions, 2494 flow [2022-01-19 06:57:55,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:55,747 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:57:55,748 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:55,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 06:57:55,748 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:57:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:57:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -779115575, now seen corresponding path program 1 times [2022-01-19 06:57:55,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:57:55,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616630687] [2022-01-19 06:57:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:57:55,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:57:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:57:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-19 06:57:55,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:57:55,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616630687] [2022-01-19 06:57:55,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616630687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:57:55,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:57:55,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:57:55,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967936483] [2022-01-19 06:57:55,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:57:55,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:57:55,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:57:55,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:57:55,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:57:55,826 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2022-01-19 06:57:55,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 472 transitions, 2494 flow. Second operand has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:55,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:57:55,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2022-01-19 06:57:55,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:58:05,282 INFO L129 PetriNetUnfolder]: 9695/54623 cut-off events. [2022-01-19 06:58:05,282 INFO L130 PetriNetUnfolder]: For 44119/45031 co-relation queries the response was YES. [2022-01-19 06:58:05,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94309 conditions, 54623 events. 9695/54623 cut-off events. For 44119/45031 co-relation queries the response was YES. Maximal size of possible extension queue 1843. Compared 850959 event pairs, 6162 based on Foata normal form. 951/49778 useless extension candidates. Maximal degree in co-relation 94260. Up to 12696 conditions per place. [2022-01-19 06:58:05,895 INFO L132 encePairwiseOnDemand]: 341/350 looper letters, 136 selfloop transitions, 17 changer transitions 34/490 dead transitions. [2022-01-19 06:58:05,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 490 transitions, 2977 flow [2022-01-19 06:58:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 06:58:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 06:58:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2264 transitions. [2022-01-19 06:58:05,899 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8085714285714286 [2022-01-19 06:58:05,899 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2264 transitions. [2022-01-19 06:58:05,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2264 transitions. [2022-01-19 06:58:05,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:58:05,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2264 transitions. [2022-01-19 06:58:05,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:05,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:05,904 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:05,904 INFO L186 Difference]: Start difference. First operand has 486 places, 472 transitions, 2494 flow. Second operand 8 states and 2264 transitions. [2022-01-19 06:58:05,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 490 transitions, 2977 flow [2022-01-19 06:58:06,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 490 transitions, 2784 flow, removed 16 selfloop flow, removed 21 redundant places. [2022-01-19 06:58:06,059 INFO L242 Difference]: Finished difference. Result has 457 places, 454 transitions, 2214 flow [2022-01-19 06:58:06,060 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2214, PETRI_PLACES=457, PETRI_TRANSITIONS=454} [2022-01-19 06:58:06,060 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 139 predicate places. [2022-01-19 06:58:06,061 INFO L470 AbstractCegarLoop]: Abstraction has has 457 places, 454 transitions, 2214 flow [2022-01-19 06:58:06,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:06,061 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:58:06,062 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:06,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 06:58:06,062 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:58:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:58:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 890640825, now seen corresponding path program 5 times [2022-01-19 06:58:06,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:58:06,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769502874] [2022-01-19 06:58:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:58:06,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:58:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:58:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:58:06,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:58:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769502874] [2022-01-19 06:58:06,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769502874] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:58:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796176487] [2022-01-19 06:58:06,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 06:58:06,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:58:06,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:58:06,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:58:06,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:58:06,460 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-19 06:58:06,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:58:06,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-19 06:58:06,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:58:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-19 06:58:07,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:58:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-19 06:58:07,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796176487] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:58:07,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:58:07,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 48 [2022-01-19 06:58:07,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550528041] [2022-01-19 06:58:07,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:58:07,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 06:58:07,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:58:07,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 06:58:07,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2022-01-19 06:58:07,793 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 350 [2022-01-19 06:58:07,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 454 transitions, 2214 flow. Second operand has 48 states, 48 states have (on average 236.58333333333334) internal successors, (11356), 48 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:07,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:58:07,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 350 [2022-01-19 06:58:07,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:58:48,095 INFO L129 PetriNetUnfolder]: 35189/208551 cut-off events. [2022-01-19 06:58:48,095 INFO L130 PetriNetUnfolder]: For 130088/138668 co-relation queries the response was YES. [2022-01-19 06:58:50,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345613 conditions, 208551 events. 35189/208551 cut-off events. For 130088/138668 co-relation queries the response was YES. Maximal size of possible extension queue 4481. Compared 3834585 event pairs, 14550 based on Foata normal form. 2984/192665 useless extension candidates. Maximal degree in co-relation 345572. Up to 8921 conditions per place. [2022-01-19 06:58:51,391 INFO L132 encePairwiseOnDemand]: 315/350 looper letters, 842 selfloop transitions, 220 changer transitions 36/1346 dead transitions. [2022-01-19 06:58:51,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 1346 transitions, 8923 flow [2022-01-19 06:58:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-01-19 06:58:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2022-01-19 06:58:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 27419 transitions. [2022-01-19 06:58:51,409 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6812173913043478 [2022-01-19 06:58:51,409 INFO L72 ComplementDD]: Start complementDD. Operand 115 states and 27419 transitions. [2022-01-19 06:58:51,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 27419 transitions. [2022-01-19 06:58:51,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:58:51,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 115 states and 27419 transitions. [2022-01-19 06:58:51,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 116 states, 115 states have (on average 238.42608695652174) internal successors, (27419), 115 states have internal predecessors, (27419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:51,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 116 states, 116 states have (on average 350.0) internal successors, (40600), 116 states have internal predecessors, (40600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:51,474 INFO L81 ComplementDD]: Finished complementDD. Result has 116 states, 116 states have (on average 350.0) internal successors, (40600), 116 states have internal predecessors, (40600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:51,474 INFO L186 Difference]: Start difference. First operand has 457 places, 454 transitions, 2214 flow. Second operand 115 states and 27419 transitions. [2022-01-19 06:58:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 1346 transitions, 8923 flow [2022-01-19 06:58:51,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1346 transitions, 8579 flow, removed 96 selfloop flow, removed 10 redundant places. [2022-01-19 06:58:51,767 INFO L242 Difference]: Finished difference. Result has 612 places, 632 transitions, 4085 flow [2022-01-19 06:58:51,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=115, PETRI_FLOW=4085, PETRI_PLACES=612, PETRI_TRANSITIONS=632} [2022-01-19 06:58:51,768 INFO L334 CegarLoopForPetriNet]: 318 programPoint places, 294 predicate places. [2022-01-19 06:58:51,768 INFO L470 AbstractCegarLoop]: Abstraction has has 612 places, 632 transitions, 4085 flow [2022-01-19 06:58:51,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 236.58333333333334) internal successors, (11356), 48 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:51,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:58:51,770 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:51,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-19 06:58:51,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 06:58:51,974 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 06:58:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:58:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 286611363, now seen corresponding path program 1 times [2022-01-19 06:58:51,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:58:51,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729360976] [2022-01-19 06:58:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:58:51,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:58:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:58:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-19 06:58:52,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:58:52,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729360976] [2022-01-19 06:58:52,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729360976] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:58:52,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537947290] [2022-01-19 06:58:52,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:58:52,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:58:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:58:52,788 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:58:52,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:58:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:58:52,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-19 06:58:52,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:58:53,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:53,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:58:53,652 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 06:58:53,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 06:58:53,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:53,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:54,289 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:58:54,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:58:54,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:54,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:54,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:54,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 06:58:55,825 INFO L353 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-01-19 06:58:55,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2022-01-19 06:58:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:58:55,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:58:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-19 06:58:59,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537947290] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:58:59,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:58:59,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 37, 13] total 75 [2022-01-19 06:58:59,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423544343] [2022-01-19 06:58:59,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:58:59,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-01-19 06:58:59,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:58:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-01-19 06:58:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=5232, Unknown=4, NotChecked=0, Total=5550 [2022-01-19 06:58:59,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 350 [2022-01-19 06:58:59,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 632 transitions, 4085 flow. Second operand has 75 states, 75 states have (on average 212.49333333333334) internal successors, (15937), 75 states have internal predecessors, (15937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:58:59,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:58:59,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 350 [2022-01-19 06:58:59,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:59:08,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse7 (+ c_~a1~0.base 1))) (and (forall ((~a2~0.base Int)) (or (= |c_thread1Thread1of1ForFork1_#t~mem1#1| (select (select |c_#memory_int| ~a2~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~a2~0.offset))) (forall ((~a3~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset))) (or (not (= .cse0 (select (select |c_#memory_int| ~a2~0.base) c_~a2~0.offset))) (not (= .cse0 (select (select |c_#memory_int| c_~a1~0.base) c_~a1~0.offset)))))))) (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~a2~0.base)) (.cse6 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse3 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse4 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse3 (+ .cse4 c_~a1~0.offset)) (select .cse5 (+ .cse4 c_~a2~0.offset)))) (not (= .cse6 (select .cse5 c_~a2~0.offset))) (not (= .cse6 (select .cse3 c_~a1~0.offset)))))) (< .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-19 06:59:53,466 WARN L228 SmtUtils]: Spent 25.47s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 07:00:08,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse7 (+ c_~a1~0.base 1))) (and (forall ((~a2~0.base Int)) (or (= |c_thread1Thread1of1ForFork1_#t~mem1#1| (select (select |c_#memory_int| ~a2~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~a2~0.offset))) (forall ((~a3~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset))) (or (not (= .cse0 (select (select |c_#memory_int| ~a2~0.base) c_~a2~0.offset))) (not (= .cse0 (select (select |c_#memory_int| c_~a1~0.base) c_~a1~0.offset)))))))) (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (not (= |c_thread3Thread1of1ForFork0_#t~mem14#1| |c_thread3Thread1of1ForFork0_#t~mem13#1|)) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~a2~0.base)) (.cse6 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse3 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse4 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse3 (+ .cse4 c_~a1~0.offset)) (select .cse5 (+ .cse4 c_~a2~0.offset)))) (not (= .cse6 (select .cse5 c_~a2~0.offset))) (not (= .cse6 (select .cse3 c_~a1~0.offset)))))) (< .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-19 07:00:22,721 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse6 (+ c_~a1~0.base 1))) (and (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (not (= |c_thread3Thread1of1ForFork0_#t~mem14#1| |c_thread3Thread1of1ForFork0_#t~mem13#1|)) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~a2~0.base)) (.cse5 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse2 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse3 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse2 (+ .cse3 c_~a1~0.offset)) (select .cse4 (+ .cse3 c_~a2~0.offset)))) (not (= .cse5 (select .cse4 c_~a2~0.offset))) (not (= .cse5 (select .cse2 c_~a1~0.offset)))))) (< .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (not (let ((.cse7 (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|))) (= (select (select |c_#memory_int| c_~a3~0.base) (+ .cse7 c_~a3~0.offset)) (select (select |c_#memory_int| c_~a1~0.base) (+ .cse7 c_~a1~0.offset))))) (not (= |c_thread2Thread1of1ForFork2_#t~mem7#1| |c_thread2Thread1of1ForFork2_#t~mem8#1|))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-19 07:00:25,400 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse7 (+ c_~a1~0.base 1))) (and (forall ((~a2~0.base Int)) (or (= |c_thread1Thread1of1ForFork1_#t~mem1#1| (select (select |c_#memory_int| ~a2~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~a2~0.offset))) (forall ((~a3~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset))) (or (not (= .cse0 (select (select |c_#memory_int| ~a2~0.base) c_~a2~0.offset))) (not (= .cse0 (select (select |c_#memory_int| c_~a1~0.base) c_~a1~0.offset)))))))) (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~a2~0.base)) (.cse6 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse3 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse4 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse3 (+ .cse4 c_~a1~0.offset)) (select .cse5 (+ .cse4 c_~a2~0.offset)))) (not (= .cse6 (select .cse5 c_~a2~0.offset))) (not (= .cse6 (select .cse3 c_~a1~0.offset)))))) (< .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (= |c_thread1Thread1of1ForFork1_#t~mem2#1| |c_thread1Thread1of1ForFork1_#t~mem1#1|) (forall ((~a3~0.base Int)) (let ((.cse8 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset))) (or (not (= (select (select |c_#memory_int| c_~a2~0.base) c_~a2~0.offset) .cse8)) (not (= .cse8 (select (select |c_#memory_int| c_~a1~0.base) c_~a1~0.offset))))))) (< .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (not (let ((.cse9 (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|))) (= (select (select |c_#memory_int| c_~a3~0.base) (+ .cse9 c_~a3~0.offset)) (select (select |c_#memory_int| c_~a1~0.base) (+ .cse9 c_~a1~0.offset))))) (not (= |c_thread2Thread1of1ForFork2_#t~mem7#1| |c_thread2Thread1of1ForFork2_#t~mem8#1|))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-19 07:00:36,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse7 (+ c_~a1~0.base 1))) (and (forall ((~a2~0.base Int)) (or (= |c_thread1Thread1of1ForFork1_#t~mem1#1| (select (select |c_#memory_int| ~a2~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~a2~0.offset))) (forall ((~a3~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset))) (or (not (= .cse0 (select (select |c_#memory_int| ~a2~0.base) c_~a2~0.offset))) (not (= .cse0 (select (select |c_#memory_int| c_~a1~0.base) c_~a1~0.offset)))))))) (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (not (= |c_thread3Thread1of1ForFork0_#t~mem14#1| |c_thread3Thread1of1ForFork0_#t~mem13#1|)) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~a2~0.base)) (.cse6 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse3 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse4 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse3 (+ .cse4 c_~a1~0.offset)) (select .cse5 (+ .cse4 c_~a2~0.offset)))) (not (= .cse6 (select .cse5 c_~a2~0.offset))) (not (= .cse6 (select .cse3 c_~a1~0.offset)))))) (< .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (= |c_thread1Thread1of1ForFork1_#t~mem2#1| |c_thread1Thread1of1ForFork1_#t~mem1#1|) (forall ((~a3~0.base Int)) (let ((.cse8 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset))) (or (not (= (select (select |c_#memory_int| c_~a2~0.base) c_~a2~0.offset) .cse8)) (not (= .cse8 (select (select |c_#memory_int| c_~a1~0.base) c_~a1~0.offset))))))) (< .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-19 07:00:42,952 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse6 (+ c_~a1~0.base 1))) (and (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (not (= (select (select |c_#memory_int| c_~a1~0.base) 0) (select (select |c_#memory_int| c_~a2~0.base) 0))) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~a2~0.base)) (.cse5 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse2 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse3 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse2 (+ .cse3 c_~a1~0.offset)) (select .cse4 (+ .cse3 c_~a2~0.offset)))) (not (= .cse5 (select .cse4 c_~a2~0.offset))) (not (= .cse5 (select .cse2 c_~a1~0.offset)))))) (< .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-01-19 07:00:43,541 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse6 (+ c_~a1~0.base 1))) (and (not (= (select (select |c_#memory_int| c_~a1~0.base) (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~a1~0.offset)) (select (select |c_#memory_int| c_~a2~0.base) 0))) (= (select |c_#valid| c_~a1~0.base) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_~a2~0.offset 0) (= 0 |c_thread3Thread1of1ForFork0_~i~2#1|) (not (= c_~a1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~a3~0.offset 0) (forall ((~a3~0.base Int) (~a2~0.base Int)) (let ((.cse4 (select |c_#memory_int| ~a2~0.base)) (.cse5 (select (select |c_#memory_int| ~a3~0.base) c_~a3~0.offset)) (.cse2 (select |c_#memory_int| c_~a1~0.base))) (or (let ((.cse3 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (= (select .cse2 (+ .cse3 c_~a1~0.offset)) (select .cse4 (+ .cse3 c_~a2~0.offset)))) (not (= .cse5 (select .cse4 c_~a2~0.offset))) (not (= .cse5 (select .cse2 c_~a1~0.offset)))))) (< .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~a1~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false