./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 02:40:54,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:40:54,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:40:54,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:40:54,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:40:54,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:40:54,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:40:54,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:40:54,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:40:54,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:40:54,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:40:54,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:40:54,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:40:54,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:40:54,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:40:54,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:40:54,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:40:54,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:40:54,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:40:54,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:40:54,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:40:54,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:40:54,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:40:54,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:40:54,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:40:54,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:40:54,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:40:54,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:40:54,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:40:54,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:40:54,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:40:54,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:40:54,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:40:54,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:40:54,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:40:54,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:40:54,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:40:54,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:40:54,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:40:54,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:40:54,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:40:54,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 02:40:54,355 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:40:54,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:40:54,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:40:54,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:40:54,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:40:54,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:40:54,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:40:54,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:40:54,359 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:40:54,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:40:54,360 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:40:54,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 02:40:54,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:40:54,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:40:54,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:40:54,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:40:54,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:40:54,361 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:40:54,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:40:54,361 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:40:54,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:40:54,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:40:54,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:40:54,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:40:54,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:40:54,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:40:54,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:40:54,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:40:54,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 02:40:54,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 02:40:54,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:40:54,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:40:54,364 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:40:54,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:40:54,365 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:40:54,365 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 02:40:54,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:40:54,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:40:54,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:40:54,707 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:40:54,708 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:40:54,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-31 02:40:55,966 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:40:56,192 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:40:56,192 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-31 02:40:56,198 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475819eb2/361bb64b44834424b54529fd727e41d3/FLAGa335f0643 [2023-08-31 02:40:56,210 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475819eb2/361bb64b44834424b54529fd727e41d3 [2023-08-31 02:40:56,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:40:56,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:40:56,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:40:56,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:40:56,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:40:56,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d4c1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56, skipping insertion in model container [2023-08-31 02:40:56,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:40:56,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:40:56,443 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-31 02:40:56,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:40:56,478 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:40:56,518 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-31 02:40:56,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:40:56,540 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:40:56,542 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:40:56,548 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:40:56,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56 WrapperNode [2023-08-31 02:40:56,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:40:56,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:40:56,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:40:56,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:40:56,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,608 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-08-31 02:40:56,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:40:56,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:40:56,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:40:56,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:40:56,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,658 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:40:56,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:40:56,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:40:56,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:40:56,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (1/1) ... [2023-08-31 02:40:56,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:40:56,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:40:56,701 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) [2023-08-31 02:40:56,725 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 [2023-08-31 02:40:56,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:40:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:40:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 02:40:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 02:40:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:40:56,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:40:56,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:40:56,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:40:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:40:56,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:40:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-31 02:40:56,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-31 02:40:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 02:40:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:40:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:40:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 02:40:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:40:56,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:40:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:40:56,756 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:40:56,896 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:40:56,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:40:57,202 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:40:57,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:40:57,285 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-31 02:40:57,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:40:57 BoogieIcfgContainer [2023-08-31 02:40:57,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:40:57,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:40:57,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:40:57,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:40:57,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:40:56" (1/3) ... [2023-08-31 02:40:57,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49544442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:40:57, skipping insertion in model container [2023-08-31 02:40:57,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:40:56" (2/3) ... [2023-08-31 02:40:57,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49544442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:40:57, skipping insertion in model container [2023-08-31 02:40:57,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:40:57" (3/3) ... [2023-08-31 02:40:57,295 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-08-31 02:40:57,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:40:57,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:40:57,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:40:57,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:40:57,460 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-31 02:40:57,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 356 flow [2023-08-31 02:40:57,581 INFO L130 PetriNetUnfolder]: 12/158 cut-off events. [2023-08-31 02:40:57,581 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:40:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 158 events. 12/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-08-31 02:40:57,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 356 flow [2023-08-31 02:40:57,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 316 flow [2023-08-31 02:40:57,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:40:57,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 146 transitions, 316 flow [2023-08-31 02:40:57,606 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 316 flow [2023-08-31 02:40:57,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 316 flow [2023-08-31 02:40:57,649 INFO L130 PetriNetUnfolder]: 12/146 cut-off events. [2023-08-31 02:40:57,650 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:40:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 12/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-08-31 02:40:57,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2023-08-31 02:41:02,605 INFO L134 LiptonReduction]: Checked pairs total: 3482 [2023-08-31 02:41:02,606 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-31 02:41:02,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:41:02,625 INFO L357 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=true, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5774221, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:41:02,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-31 02:41:02,632 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2023-08-31 02:41:02,633 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:41:02,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:02,634 INFO L208 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] [2023-08-31 02:41:02,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:02,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1385427649, now seen corresponding path program 1 times [2023-08-31 02:41:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475480989] [2023-08-31 02:41:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:41:03,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:03,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475480989] [2023-08-31 02:41:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475480989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:41:03,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:41:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:41:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188486022] [2023-08-31 02:41:03,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:41:03,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:41:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:41:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:41:03,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-08-31 02:41:03,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:03,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:03,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-08-31 02:41:03,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:03,439 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2023-08-31 02:41:03,439 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-31 02:41:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7098 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2023-08-31 02:41:03,456 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-31 02:41:03,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-08-31 02:41:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:41:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:41:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-08-31 02:41:03,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2023-08-31 02:41:03,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-08-31 02:41:03,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-08-31 02:41:03,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:03,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-08-31 02:41:03,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:03,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:03,498 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:03,500 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 586 transitions. [2023-08-31 02:41:03,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-08-31 02:41:03,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-31 02:41:03,509 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-08-31 02:41:03,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-08-31 02:41:03,516 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-31 02:41:03,519 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-08-31 02:41:03,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:03,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:03,520 INFO L208 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] [2023-08-31 02:41:03,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 02:41:03,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:03,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1622835390, now seen corresponding path program 1 times [2023-08-31 02:41:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:03,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803126062] [2023-08-31 02:41:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:41:03,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:03,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803126062] [2023-08-31 02:41:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803126062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:41:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:41:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:41:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131927145] [2023-08-31 02:41:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:41:03,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:41:03,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:41:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:41:03,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-08-31 02:41:03,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:03,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:03,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-08-31 02:41:03,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:04,059 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2023-08-31 02:41:04,059 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2023-08-31 02:41:04,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8125 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2023-08-31 02:41:04,072 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-31 02:41:04,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-08-31 02:41:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:41:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:41:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2023-08-31 02:41:04,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49746621621621623 [2023-08-31 02:41:04,075 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 589 transitions. [2023-08-31 02:41:04,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions. [2023-08-31 02:41:04,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:04,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions. [2023-08-31 02:41:04,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,080 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,080 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 589 transitions. [2023-08-31 02:41:04,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-08-31 02:41:04,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 02:41:04,082 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-08-31 02:41:04,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-31 02:41:04,084 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-31 02:41:04,084 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-08-31 02:41:04,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:04,085 INFO L208 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] [2023-08-31 02:41:04,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 02:41:04,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:04,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805984, now seen corresponding path program 1 times [2023-08-31 02:41:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611441805] [2023-08-31 02:41:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:41:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611441805] [2023-08-31 02:41:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611441805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:41:04,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:41:04,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:41:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255901066] [2023-08-31 02:41:04,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:41:04,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:41:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:41:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:41:04,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-08-31 02:41:04,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:04,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-08-31 02:41:04,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:04,488 INFO L130 PetriNetUnfolder]: 1632/2232 cut-off events. [2023-08-31 02:41:04,488 INFO L131 PetriNetUnfolder]: For 545/694 co-relation queries the response was YES. [2023-08-31 02:41:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 2232 events. 1632/2232 cut-off events. For 545/694 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8389 event pairs, 977 based on Foata normal form. 149/1982 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-08-31 02:41:04,502 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-31 02:41:04,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-08-31 02:41:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:41:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:41:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-08-31 02:41:04,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2023-08-31 02:41:04,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-08-31 02:41:04,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-08-31 02:41:04,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:04,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-08-31 02:41:04,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,510 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,510 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 586 transitions. [2023-08-31 02:41:04,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-08-31 02:41:04,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 02:41:04,514 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-08-31 02:41:04,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-31 02:41:04,516 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-31 02:41:04,518 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-08-31 02:41:04,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:04,519 INFO L208 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] [2023-08-31 02:41:04,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 02:41:04,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:04,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1347991008, now seen corresponding path program 1 times [2023-08-31 02:41:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697912783] [2023-08-31 02:41:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:41:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697912783] [2023-08-31 02:41:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697912783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:41:04,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:41:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:41:04,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113744541] [2023-08-31 02:41:04,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:41:04,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:41:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:41:04,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:41:04,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 296 [2023-08-31 02:41:04,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:04,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 296 [2023-08-31 02:41:04,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:04,918 INFO L130 PetriNetUnfolder]: 1632/2233 cut-off events. [2023-08-31 02:41:04,918 INFO L131 PetriNetUnfolder]: For 878/1027 co-relation queries the response was YES. [2023-08-31 02:41:04,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2233 events. 1632/2233 cut-off events. For 878/1027 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 1243 based on Foata normal form. 149/1978 useless extension candidates. Maximal degree in co-relation 1883. Up to 2223 conditions per place. [2023-08-31 02:41:04,933 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-31 02:41:04,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-08-31 02:41:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:41:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:41:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-31 02:41:04,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48873873873873874 [2023-08-31 02:41:04,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-31 02:41:04,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-31 02:41:04,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:04,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-31 02:41:04,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,940 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 434 transitions. [2023-08-31 02:41:04,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-08-31 02:41:04,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 02:41:04,945 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-08-31 02:41:04,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-31 02:41:04,946 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-31 02:41:04,947 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-08-31 02:41:04,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:04,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:04,947 INFO L208 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] [2023-08-31 02:41:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 02:41:04,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:04,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash -406219004, now seen corresponding path program 1 times [2023-08-31 02:41:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539406150] [2023-08-31 02:41:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:41:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539406150] [2023-08-31 02:41:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539406150] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:41:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503226234] [2023-08-31 02:41:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:05,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:41:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:41:05,721 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) [2023-08-31 02:41:05,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 02:41:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:05,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-31 02:41:05,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:41:06,008 INFO L350 Elim1Store]: Elim1 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 [2023-08-31 02:41:06,073 INFO L350 Elim1Store]: Elim1 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 [2023-08-31 02:41:06,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:41:06,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:41:06,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:41:06,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:41:06,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-31 02:41:06,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-08-31 02:41:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:41:06,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:41:06,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-08-31 02:41:06,604 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) is different from false [2023-08-31 02:41:06,875 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~min~0)))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 2 .cse3)) (< 2147483646 .cse3))))))))) is different from false [2023-08-31 02:41:06,917 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse1 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 (+ 2 .cse2)) (< 2147483646 .cse2)))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse0) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 2 .cse5)) (< 2147483646 .cse5))))))))) is different from false [2023-08-31 02:41:07,003 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ .cse1 2)) (< 2147483646 .cse1)))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse5) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse5 (+ .cse6 2)) (< 2147483646 .cse6))))))))) is different from false [2023-08-31 02:41:07,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:41:07,032 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 77 [2023-08-31 02:41:07,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2845 treesize of output 2653 [2023-08-31 02:41:07,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2023-08-31 02:41:07,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 120 [2023-08-31 02:41:07,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2023-08-31 02:41:07,209 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:41:07,210 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2023-08-31 02:41:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-31 02:41:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503226234] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:41:07,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:41:07,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2023-08-31 02:41:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078856802] [2023-08-31 02:41:07,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:41:07,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-31 02:41:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-31 02:41:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=7, NotChecked=204, Total=870 [2023-08-31 02:41:07,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 296 [2023-08-31 02:41:07,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:07,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:07,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 296 [2023-08-31 02:41:07,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:11,472 INFO L130 PetriNetUnfolder]: 12624/17356 cut-off events. [2023-08-31 02:41:11,472 INFO L131 PetriNetUnfolder]: For 4404/5446 co-relation queries the response was YES. [2023-08-31 02:41:11,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44463 conditions, 17356 events. 12624/17356 cut-off events. For 4404/5446 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 93108 event pairs, 1024 based on Foata normal form. 1052/14660 useless extension candidates. Maximal degree in co-relation 44449. Up to 4507 conditions per place. [2023-08-31 02:41:11,557 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 240 selfloop transitions, 47 changer transitions 267/555 dead transitions. [2023-08-31 02:41:11,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 555 transitions, 2750 flow [2023-08-31 02:41:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-31 02:41:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-31 02:41:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3633 transitions. [2023-08-31 02:41:11,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37192874692874694 [2023-08-31 02:41:11,567 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3633 transitions. [2023-08-31 02:41:11,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3633 transitions. [2023-08-31 02:41:11,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:11,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3633 transitions. [2023-08-31 02:41:11,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 110.0909090909091) internal successors, (3633), 33 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:11,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:11,596 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:11,596 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 33 states and 3633 transitions. [2023-08-31 02:41:11,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 555 transitions, 2750 flow [2023-08-31 02:41:11,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 555 transitions, 2746 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 02:41:11,682 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 498 flow [2023-08-31 02:41:11,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=498, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2023-08-31 02:41:11,685 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-08-31 02:41:11,686 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 498 flow [2023-08-31 02:41:11,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:11,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:11,689 INFO L208 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] [2023-08-31 02:41:11,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-31 02:41:11,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:41:11,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:11,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -776649670, now seen corresponding path program 2 times [2023-08-31 02:41:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993105168] [2023-08-31 02:41:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:41:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993105168] [2023-08-31 02:41:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993105168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:41:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:41:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:41:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627847081] [2023-08-31 02:41:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:41:12,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:41:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:41:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:41:12,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2023-08-31 02:41:12,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:12,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:12,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2023-08-31 02:41:12,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:13,971 INFO L130 PetriNetUnfolder]: 9630/13442 cut-off events. [2023-08-31 02:41:13,972 INFO L131 PetriNetUnfolder]: For 68558/70152 co-relation queries the response was YES. [2023-08-31 02:41:14,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52345 conditions, 13442 events. 9630/13442 cut-off events. For 68558/70152 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 72658 event pairs, 864 based on Foata normal form. 1595/14187 useless extension candidates. Maximal degree in co-relation 52298. Up to 7235 conditions per place. [2023-08-31 02:41:14,065 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 93 selfloop transitions, 2 changer transitions 160/256 dead transitions. [2023-08-31 02:41:14,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 256 transitions, 2064 flow [2023-08-31 02:41:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:41:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:41:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2023-08-31 02:41:14,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2023-08-31 02:41:14,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2023-08-31 02:41:14,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2023-08-31 02:41:14,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:14,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2023-08-31 02:41:14,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:14,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:14,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:14,074 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 498 flow. Second operand 5 states and 752 transitions. [2023-08-31 02:41:14,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 256 transitions, 2064 flow [2023-08-31 02:41:14,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 256 transitions, 1985 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-08-31 02:41:14,507 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 301 flow [2023-08-31 02:41:14,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-08-31 02:41:14,509 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-08-31 02:41:14,510 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 301 flow [2023-08-31 02:41:14,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:14,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:14,510 INFO L208 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] [2023-08-31 02:41:14,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 02:41:14,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:14,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash -421841092, now seen corresponding path program 3 times [2023-08-31 02:41:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094973691] [2023-08-31 02:41:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:41:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094973691] [2023-08-31 02:41:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094973691] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:41:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197390368] [2023-08-31 02:41:15,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:41:15,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:41:15,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:41:15,281 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) [2023-08-31 02:41:15,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 02:41:15,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 02:41:15,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:41:15,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-31 02:41:15,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:41:15,607 INFO L350 Elim1Store]: Elim1 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 [2023-08-31 02:41:15,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:41:15,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:41:15,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-31 02:41:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:41:15,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:41:16,148 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2023-08-31 02:41:20,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2023-08-31 02:41:20,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:41:20,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-08-31 02:41:20,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-08-31 02:41:20,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-31 02:41:20,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-31 02:41:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-31 02:41:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197390368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:41:20,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:41:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 26 [2023-08-31 02:41:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631631392] [2023-08-31 02:41:20,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:41:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-31 02:41:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-31 02:41:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=522, Unknown=7, NotChecked=98, Total=756 [2023-08-31 02:41:20,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 296 [2023-08-31 02:41:20,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 301 flow. Second operand has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:20,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:20,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 296 [2023-08-31 02:41:20,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:29,532 INFO L130 PetriNetUnfolder]: 24993/34453 cut-off events. [2023-08-31 02:41:29,532 INFO L131 PetriNetUnfolder]: For 192048/192048 co-relation queries the response was YES. [2023-08-31 02:41:29,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136650 conditions, 34453 events. 24993/34453 cut-off events. For 192048/192048 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 198980 event pairs, 1319 based on Foata normal form. 20/31888 useless extension candidates. Maximal degree in co-relation 136616. Up to 7291 conditions per place. [2023-08-31 02:41:29,754 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 388 selfloop transitions, 177 changer transitions 760/1325 dead transitions. [2023-08-31 02:41:29,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1325 transitions, 9162 flow [2023-08-31 02:41:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-31 02:41:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-31 02:41:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 9798 transitions. [2023-08-31 02:41:29,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.380475302889096 [2023-08-31 02:41:29,783 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 9798 transitions. [2023-08-31 02:41:29,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 9798 transitions. [2023-08-31 02:41:29,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:41:29,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 9798 transitions. [2023-08-31 02:41:29,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 112.62068965517241) internal successors, (9798), 87 states have internal predecessors, (9798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:29,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:29,863 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:29,864 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 301 flow. Second operand 87 states and 9798 transitions. [2023-08-31 02:41:29,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1325 transitions, 9162 flow [2023-08-31 02:41:31,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1325 transitions, 8285 flow, removed 408 selfloop flow, removed 10 redundant places. [2023-08-31 02:41:31,372 INFO L231 Difference]: Finished difference. Result has 211 places, 233 transitions, 2150 flow [2023-08-31 02:41:31,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=2150, PETRI_PLACES=211, PETRI_TRANSITIONS=233} [2023-08-31 02:41:31,372 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2023-08-31 02:41:31,372 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 233 transitions, 2150 flow [2023-08-31 02:41:31,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:31,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:41:31,374 INFO L208 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] [2023-08-31 02:41:31,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-31 02:41:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-31 02:41:31,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:41:31,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:41:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -551404586, now seen corresponding path program 4 times [2023-08-31 02:41:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:41:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708576271] [2023-08-31 02:41:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:41:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:41:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:41:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:41:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:41:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708576271] [2023-08-31 02:41:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708576271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:41:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649673221] [2023-08-31 02:41:32,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 02:41:32,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:41:32,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:41:32,804 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) [2023-08-31 02:41:32,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 02:41:32,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 02:41:32,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:41:32,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-31 02:41:32,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:41:32,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 862 [2023-08-31 02:41:33,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:41:33,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:41:33,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-08-31 02:41:33,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-31 02:41:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:41:33,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:41:33,420 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_354) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse0 1)) (< 2147483647 .cse0)))) is different from false [2023-08-31 02:41:33,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2023-08-31 02:41:33,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-08-31 02:41:33,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-08-31 02:41:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:41:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649673221] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:41:34,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:41:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2023-08-31 02:41:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505414493] [2023-08-31 02:41:34,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:41:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-31 02:41:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:41:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-31 02:41:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=752, Unknown=14, NotChecked=58, Total=992 [2023-08-31 02:41:34,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 296 [2023-08-31 02:41:34,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 233 transitions, 2150 flow. Second operand has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:41:34,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:41:34,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 296 [2023-08-31 02:41:34,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:41:42,568 WARN L222 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 51 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:42:12,778 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 66 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:42:19,151 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 56 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:42:56,081 WARN L222 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 59 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:43:31,306 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 58 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:43:53,890 INFO L130 PetriNetUnfolder]: 46739/65136 cut-off events. [2023-08-31 02:43:53,890 INFO L131 PetriNetUnfolder]: For 4937599/4937599 co-relation queries the response was YES. [2023-08-31 02:43:54,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624230 conditions, 65136 events. 46739/65136 cut-off events. For 4937599/4937599 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 418163 event pairs, 1797 based on Foata normal form. 35/65170 useless extension candidates. Maximal degree in co-relation 624132. Up to 17165 conditions per place. [2023-08-31 02:43:55,161 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 532 selfloop transitions, 475 changer transitions 1128/2135 dead transitions. [2023-08-31 02:43:55,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 2135 transitions, 32125 flow [2023-08-31 02:43:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-08-31 02:43:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2023-08-31 02:43:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 13204 transitions. [2023-08-31 02:43:55,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3512449457331347 [2023-08-31 02:43:55,184 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 13204 transitions. [2023-08-31 02:43:55,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 13204 transitions. [2023-08-31 02:43:55,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:43:55,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 13204 transitions. [2023-08-31 02:43:55,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 103.96850393700787) internal successors, (13204), 127 states have internal predecessors, (13204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:43:55,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:43:55,259 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:43:55,259 INFO L175 Difference]: Start difference. First operand has 211 places, 233 transitions, 2150 flow. Second operand 127 states and 13204 transitions. [2023-08-31 02:43:55,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 2135 transitions, 32125 flow [2023-08-31 02:44:58,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 2135 transitions, 21452 flow, removed 5210 selfloop flow, removed 44 redundant places. [2023-08-31 02:44:58,088 INFO L231 Difference]: Finished difference. Result has 350 places, 549 transitions, 7180 flow [2023-08-31 02:44:58,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=7180, PETRI_PLACES=350, PETRI_TRANSITIONS=549} [2023-08-31 02:44:58,088 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 310 predicate places. [2023-08-31 02:44:58,089 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 549 transitions, 7180 flow [2023-08-31 02:44:58,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:44:58,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:44:58,089 INFO L208 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] [2023-08-31 02:44:58,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-31 02:44:58,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:44:58,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:44:58,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:44:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -870441776, now seen corresponding path program 5 times [2023-08-31 02:44:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:44:58,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505380414] [2023-08-31 02:44:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:44:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:44:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:44:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:44:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:44:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505380414] [2023-08-31 02:44:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505380414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:44:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:44:58,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:44:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142345273] [2023-08-31 02:44:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:44:58,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:44:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:44:58,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:44:58,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:44:58,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2023-08-31 02:44:58,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 549 transitions, 7180 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:44:58,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:44:58,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2023-08-31 02:44:58,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:45:13,813 INFO L130 PetriNetUnfolder]: 36988/52684 cut-off events. [2023-08-31 02:45:13,813 INFO L131 PetriNetUnfolder]: For 8256734/8259255 co-relation queries the response was YES. [2023-08-31 02:45:15,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623450 conditions, 52684 events. 36988/52684 cut-off events. For 8256734/8259255 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 345066 event pairs, 10261 based on Foata normal form. 2048/54561 useless extension candidates. Maximal degree in co-relation 623282. Up to 40087 conditions per place. [2023-08-31 02:45:15,707 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 504 selfloop transitions, 38 changer transitions 410/990 dead transitions. [2023-08-31 02:45:15,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 990 transitions, 15337 flow [2023-08-31 02:45:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:45:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:45:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-08-31 02:45:15,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504054054054054 [2023-08-31 02:45:15,709 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-08-31 02:45:15,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-08-31 02:45:15,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:45:15,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-08-31 02:45:15,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:45:15,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:45:15,712 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:45:15,712 INFO L175 Difference]: Start difference. First operand has 350 places, 549 transitions, 7180 flow. Second operand 5 states and 746 transitions. [2023-08-31 02:45:15,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 990 transitions, 15337 flow [2023-08-31 02:46:01,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 990 transitions, 14132 flow, removed 568 selfloop flow, removed 76 redundant places. [2023-08-31 02:46:01,384 INFO L231 Difference]: Finished difference. Result has 200 places, 521 transitions, 6411 flow [2023-08-31 02:46:01,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6647, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6411, PETRI_PLACES=200, PETRI_TRANSITIONS=521} [2023-08-31 02:46:01,385 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2023-08-31 02:46:01,385 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 521 transitions, 6411 flow [2023-08-31 02:46:01,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:46:01,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:46:01,385 INFO L208 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] [2023-08-31 02:46:01,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 02:46:01,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:46:01,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:46:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash -273313860, now seen corresponding path program 6 times [2023-08-31 02:46:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:46:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888022993] [2023-08-31 02:46:01,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:46:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:46:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:46:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:46:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:46:02,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888022993] [2023-08-31 02:46:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888022993] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:46:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722370769] [2023-08-31 02:46:02,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 02:46:02,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:46:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:46:02,075 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) [2023-08-31 02:46:02,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 02:46:02,369 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 02:46:02,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:46:02,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-31 02:46:02,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:46:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:46:02,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:46:02,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:46:02,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:46:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:46:02,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:46:02,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-31 02:46:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:46:02,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:46:03,382 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (forall ((v_ArrVal_455 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse2 c_~A~0.offset))) (or (< c_~min~0 .cse0) (<= 2147483647 .cse1) (<= .cse0 (+ .cse1 1)))))) (forall ((v_ArrVal_455 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse5 (select .cse4 c_~A~0.offset))) (or (<= (select .cse4 .cse3) c_~min~0) (<= 2147483647 .cse5) (<= c_~min~0 (+ .cse5 1)))))))) is different from false [2023-08-31 02:46:03,427 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (<= c_~min~0 (+ 1 .cse0)) (<= 2147483647 .cse0) (<= (select .cse1 .cse2) c_~min~0))))) (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse3 (select .cse5 .cse2)) (.cse4 (select .cse5 c_~A~0.offset))) (or (< c_~min~0 .cse3) (<= 2147483647 .cse4) (<= .cse3 (+ 1 .cse4)))))))) is different from false [2023-08-31 02:46:03,476 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (<= (select .cse0 .cse1) c_~min~0) (<= c_~min~0 (+ .cse2 1)) (<= 2147483647 .cse2))))) (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse3 (select .cse5 .cse1)) (.cse4 (select .cse5 c_~A~0.offset))) (or (< c_~min~0 .cse3) (<= 2147483647 .cse4) (<= .cse3 (+ .cse4 1)))))))) is different from false [2023-08-31 02:46:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:46:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722370769] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 02:46:03,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 02:46:03,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 12] total 32 [2023-08-31 02:46:03,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019338549] [2023-08-31 02:46:03,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:46:03,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 02:46:03,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:46:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 02:46:03,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=701, Unknown=3, NotChecked=174, Total=1056 [2023-08-31 02:46:03,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 296 [2023-08-31 02:46:03,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 521 transitions, 6411 flow. Second operand has 11 states, 11 states have (on average 104.72727272727273) internal successors, (1152), 11 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:46:03,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:46:03,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 296 [2023-08-31 02:46:03,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:46:18,327 INFO L130 PetriNetUnfolder]: 53806/76883 cut-off events. [2023-08-31 02:46:18,327 INFO L131 PetriNetUnfolder]: For 2896362/2899943 co-relation queries the response was YES. [2023-08-31 02:46:19,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552748 conditions, 76883 events. 53806/76883 cut-off events. For 2896362/2899943 co-relation queries the response was YES. Maximal size of possible extension queue 3088. Compared 537173 event pairs, 11887 based on Foata normal form. 3014/79573 useless extension candidates. Maximal degree in co-relation 552652. Up to 39275 conditions per place. [2023-08-31 02:46:19,742 INFO L137 encePairwiseOnDemand]: 277/296 looper letters, 608 selfloop transitions, 510 changer transitions 65/1221 dead transitions. [2023-08-31 02:46:19,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1221 transitions, 17037 flow [2023-08-31 02:46:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 02:46:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 02:46:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1416 transitions. [2023-08-31 02:46:19,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39864864864864863 [2023-08-31 02:46:19,745 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1416 transitions. [2023-08-31 02:46:19,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1416 transitions. [2023-08-31 02:46:19,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:46:19,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1416 transitions. [2023-08-31 02:46:19,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:46:19,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:46:19,750 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:46:19,751 INFO L175 Difference]: Start difference. First operand has 200 places, 521 transitions, 6411 flow. Second operand 12 states and 1416 transitions. [2023-08-31 02:46:19,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1221 transitions, 17037 flow [2023-08-31 02:47:07,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1221 transitions, 16784 flow, removed 108 selfloop flow, removed 5 redundant places. [2023-08-31 02:47:07,363 INFO L231 Difference]: Finished difference. Result has 212 places, 925 transitions, 13444 flow [2023-08-31 02:47:07,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6318, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13444, PETRI_PLACES=212, PETRI_TRANSITIONS=925} [2023-08-31 02:47:07,364 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2023-08-31 02:47:07,364 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 925 transitions, 13444 flow [2023-08-31 02:47:07,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.72727272727273) internal successors, (1152), 11 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:47:07,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:47:07,365 INFO L208 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] [2023-08-31 02:47:07,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-31 02:47:07,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:47:07,569 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:47:07,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:47:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1039692612, now seen corresponding path program 7 times [2023-08-31 02:47:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:47:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911489277] [2023-08-31 02:47:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:47:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:47:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:47:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:47:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:47:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911489277] [2023-08-31 02:47:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911489277] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:47:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721520222] [2023-08-31 02:47:08,174 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 02:47:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:47:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:47:08,177 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) [2023-08-31 02:47:08,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 02:47:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:47:08,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-31 02:47:08,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:47:08,354 INFO L350 Elim1Store]: Elim1 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 [2023-08-31 02:47:08,401 INFO L350 Elim1Store]: Elim1 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 [2023-08-31 02:47:08,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:47:08,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:47:08,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:47:08,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:47:08,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:47:08,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 02:47:08,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-31 02:47:08,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-08-31 02:47:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:47:08,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:47:18,071 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_525) c_~A~0.base) c_~A~0.offset))) (or (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ 2 .cse0)) (< 2147483646 .cse0)))) is different from false [2023-08-31 02:47:18,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:47:18,622 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 60 [2023-08-31 02:47:18,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13771 treesize of output 12683 [2023-08-31 02:47:18,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 349 [2023-08-31 02:47:18,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 211 [2023-08-31 02:47:18,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 195 [2023-08-31 02:47:18,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 213 [2023-08-31 02:47:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:47:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721520222] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:47:19,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:47:19,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 35 [2023-08-31 02:47:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286561983] [2023-08-31 02:47:19,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:47:19,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 02:47:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:47:19,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 02:47:19,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1036, Unknown=40, NotChecked=68, Total=1332 [2023-08-31 02:47:19,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 296 [2023-08-31 02:47:19,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 925 transitions, 13444 flow. Second operand has 37 states, 37 states have (on average 84.43243243243244) internal successors, (3124), 37 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:47:19,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:47:19,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 296 [2023-08-31 02:47:19,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:48:20,454 INFO L130 PetriNetUnfolder]: 154125/217900 cut-off events. [2023-08-31 02:48:20,454 INFO L131 PetriNetUnfolder]: For 8463328/8463328 co-relation queries the response was YES. [2023-08-31 02:48:24,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731502 conditions, 217900 events. 154125/217900 cut-off events. For 8463328/8463328 co-relation queries the response was YES. Maximal size of possible extension queue 7901. Compared 1660223 event pairs, 15048 based on Foata normal form. 108/218006 useless extension candidates. Maximal degree in co-relation 1730535. Up to 101807 conditions per place. [2023-08-31 02:48:25,104 INFO L137 encePairwiseOnDemand]: 284/296 looper letters, 879 selfloop transitions, 1485 changer transitions 1726/4090 dead transitions. [2023-08-31 02:48:25,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 4090 transitions, 67933 flow [2023-08-31 02:48:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-08-31 02:48:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-08-31 02:48:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 8774 transitions. [2023-08-31 02:48:25,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3187300203429236 [2023-08-31 02:48:25,119 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 8774 transitions. [2023-08-31 02:48:25,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 8774 transitions. [2023-08-31 02:48:25,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:48:25,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 8774 transitions. [2023-08-31 02:48:25,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 94.34408602150538) internal successors, (8774), 93 states have internal predecessors, (8774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:48:25,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 296.0) internal successors, (27824), 94 states have internal predecessors, (27824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:48:25,168 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 296.0) internal successors, (27824), 94 states have internal predecessors, (27824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:48:25,169 INFO L175 Difference]: Start difference. First operand has 212 places, 925 transitions, 13444 flow. Second operand 93 states and 8774 transitions. [2023-08-31 02:48:25,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 4090 transitions, 67933 flow Killed by 15