./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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-three-array-min.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 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 14:43:31,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 14:43:31,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 14:43:31,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 14:43:31,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 14:43:31,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 14:43:31,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 14:43:31,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 14:43:31,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 14:43:31,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 14:43:31,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 14:43:31,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 14:43:31,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 14:43:31,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 14:43:31,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 14:43:31,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 14:43:31,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 14:43:31,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 14:43:31,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 14:43:31,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 14:43:31,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 14:43:31,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 14:43:31,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 14:43:31,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 14:43:31,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 14:43:31,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 14:43:31,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 14:43:31,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 14:43:31,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 14:43:31,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 14:43:31,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 14:43:31,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 14:43:31,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 14:43:31,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 14:43:31,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 14:43:31,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 14:43:31,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 14:43:31,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 14:43:31,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 14:43:31,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 14:43:31,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 14:43:31,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 14:43:31,543 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 14:43:31,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 14:43:31,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 14:43:31,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 14:43:31,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 14:43:31,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 14:43:31,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 14:43:31,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 14:43:31,547 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 14:43:31,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 14:43:31,548 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 14:43:31,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 14:43:31,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 14:43:31,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 14:43:31,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 14:43:31,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 14:43:31,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 14:43:31,549 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 14:43:31,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 14:43:31,549 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 14:43:31,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 14:43:31,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 14:43:31,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 14:43:31,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 14:43:31,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 14:43:31,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 14:43:31,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 14:43:31,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 14:43:31,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 14:43:31,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 14:43:31,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 14:43:31,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 14:43:31,552 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 14:43:31,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 14:43:31,552 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 14:43:31,552 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 -> 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 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 -> BEFORE [2023-09-01 14:43:31,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 14:43:31,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 14:43:31,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 14:43:31,868 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 14:43:31,872 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 14:43:31,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-09-01 14:43:33,099 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 14:43:33,244 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 14:43:33,245 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-09-01 14:43:33,251 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c1bbdd2/ff2198f3702f4686b3c5082fdce66e8a/FLAG618c049b3 [2023-09-01 14:43:33,266 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c1bbdd2/ff2198f3702f4686b3c5082fdce66e8a [2023-09-01 14:43:33,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 14:43:33,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 14:43:33,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 14:43:33,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 14:43:33,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 14:43:33,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3212aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33, skipping insertion in model container [2023-09-01 14:43:33,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 14:43:33,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 14:43:33,491 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-three-array-min.wvr.c[2815,2828] [2023-09-01 14:43:33,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 14:43:33,524 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 14:43:33,560 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-three-array-min.wvr.c[2815,2828] [2023-09-01 14:43:33,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 14:43:33,580 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 14:43:33,580 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 14:43:33,586 INFO L208 MainTranslator]: Completed translation [2023-09-01 14:43:33,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33 WrapperNode [2023-09-01 14:43:33,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 14:43:33,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 14:43:33,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 14:43:33,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 14:43:33,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,648 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 236 [2023-09-01 14:43:33,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 14:43:33,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 14:43:33,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 14:43:33,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 14:43:33,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 14:43:33,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 14:43:33,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 14:43:33,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 14:43:33,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (1/1) ... [2023-09-01 14:43:33,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 14:43:33,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:33,758 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-09-01 14:43:33,785 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-09-01 14:43:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 14:43:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 14:43:33,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 14:43:33,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 14:43:33,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 14:43:33,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 14:43:33,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 14:43:33,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 14:43:33,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 14:43:33,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 14:43:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 14:43:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 14:43:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 14:43:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 14:43:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 14:43:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 14:43:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 14:43:33,804 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 14:43:33,935 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 14:43:33,938 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 14:43:34,388 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 14:43:34,439 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 14:43:34,439 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-09-01 14:43:34,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:43:34 BoogieIcfgContainer [2023-09-01 14:43:34,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 14:43:34,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 14:43:34,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 14:43:34,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 14:43:34,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:43:33" (1/3) ... [2023-09-01 14:43:34,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57706c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:43:34, skipping insertion in model container [2023-09-01 14:43:34,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:43:33" (2/3) ... [2023-09-01 14:43:34,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57706c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:43:34, skipping insertion in model container [2023-09-01 14:43:34,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:43:34" (3/3) ... [2023-09-01 14:43:34,449 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2023-09-01 14:43:34,458 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 14:43:34,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 14:43:34,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 14:43:34,467 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 14:43:34,535 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 14:43:34,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 284 transitions, 592 flow [2023-09-01 14:43:34,653 INFO L130 PetriNetUnfolder]: 27/281 cut-off events. [2023-09-01 14:43:34,654 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:43:34,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 281 events. 27/281 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 222. Up to 3 conditions per place. [2023-09-01 14:43:34,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 284 transitions, 592 flow [2023-09-01 14:43:34,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 271 transitions, 560 flow [2023-09-01 14:43:34,667 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 14:43:34,675 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 271 transitions, 560 flow [2023-09-01 14:43:34,677 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 271 transitions, 560 flow [2023-09-01 14:43:34,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 271 transitions, 560 flow [2023-09-01 14:43:34,719 INFO L130 PetriNetUnfolder]: 27/271 cut-off events. [2023-09-01 14:43:34,719 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:43:34,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 271 events. 27/271 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 208 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 222. Up to 3 conditions per place. [2023-09-01 14:43:34,722 INFO L119 LiptonReduction]: Number of co-enabled transitions 2634 [2023-09-01 14:43:42,939 INFO L134 LiptonReduction]: Checked pairs total: 3780 [2023-09-01 14:43:42,940 INFO L136 LiptonReduction]: Total number of compositions: 300 [2023-09-01 14:43:42,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 14:43:42,956 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;@2b5d8e48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 14:43:42,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 14:43:42,966 INFO L130 PetriNetUnfolder]: 8/33 cut-off events. [2023-09-01 14:43:42,966 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:43:42,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:42,967 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] [2023-09-01 14:43:42,967 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 1 more)] === [2023-09-01 14:43:42,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash -823952724, now seen corresponding path program 1 times [2023-09-01 14:43:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092359078] [2023-09-01 14:43:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:43:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092359078] [2023-09-01 14:43:43,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092359078] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:43:43,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:43:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 14:43:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489949903] [2023-09-01 14:43:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:43:43,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 14:43:43,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:43,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 14:43:43,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 14:43:43,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 584 [2023-09-01 14:43:43,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 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-09-01 14:43:43,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:43,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 584 [2023-09-01 14:43:43,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:43,784 INFO L130 PetriNetUnfolder]: 692/923 cut-off events. [2023-09-01 14:43:43,785 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-09-01 14:43:43,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 923 events. 692/923 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3152 event pairs, 315 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 1616. Up to 907 conditions per place. [2023-09-01 14:43:43,795 INFO L137 encePairwiseOnDemand]: 581/584 looper letters, 30 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-09-01 14:43:43,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 152 flow [2023-09-01 14:43:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 14:43:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 14:43:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2023-09-01 14:43:43,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349315068493151 [2023-09-01 14:43:43,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 762 transitions. [2023-09-01 14:43:43,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 762 transitions. [2023-09-01 14:43:43,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:43,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 762 transitions. [2023-09-01 14:43:43,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 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-09-01 14:43:43,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 584.0) internal successors, (2336), 4 states have internal predecessors, (2336), 0 states have call successors, (0), 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-09-01 14:43:43,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 584.0) internal successors, (2336), 4 states have internal predecessors, (2336), 0 states have call successors, (0), 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-09-01 14:43:43,840 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 86 flow. Second operand 3 states and 762 transitions. [2023-09-01 14:43:43,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 152 flow [2023-09-01 14:43:43,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-09-01 14:43:43,848 INFO L231 Difference]: Finished difference. Result has 33 places, 35 transitions, 86 flow [2023-09-01 14:43:43,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=86, PETRI_PLACES=33, PETRI_TRANSITIONS=35} [2023-09-01 14:43:43,854 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-09-01 14:43:43,854 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 86 flow [2023-09-01 14:43:43,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 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-09-01 14:43:43,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:43,858 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] [2023-09-01 14:43:43,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 14:43:43,859 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 1 more)] === [2023-09-01 14:43:43,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1618956068, now seen corresponding path program 1 times [2023-09-01 14:43:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:43,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000556498] [2023-09-01 14:43:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:43,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:43:44,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000556498] [2023-09-01 14:43:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000556498] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:43:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:43:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:43:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041820369] [2023-09-01 14:43:44,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:43:44,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:43:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:43:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:43:44,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 584 [2023-09-01 14:43:44,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 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-09-01 14:43:44,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:44,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 584 [2023-09-01 14:43:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:44,270 INFO L130 PetriNetUnfolder]: 692/925 cut-off events. [2023-09-01 14:43:44,270 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:43:44,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 925 events. 692/925 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3119 event pairs, 315 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 1857. Up to 906 conditions per place. [2023-09-01 14:43:44,275 INFO L137 encePairwiseOnDemand]: 577/584 looper letters, 28 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-09-01 14:43:44,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 158 flow [2023-09-01 14:43:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 14:43:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 14:43:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1008 transitions. [2023-09-01 14:43:44,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315068493150685 [2023-09-01 14:43:44,278 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1008 transitions. [2023-09-01 14:43:44,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1008 transitions. [2023-09-01 14:43:44,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:44,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1008 transitions. [2023-09-01 14:43:44,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 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-09-01 14:43:44,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 584.0) internal successors, (2920), 5 states have internal predecessors, (2920), 0 states have call successors, (0), 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-09-01 14:43:44,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 584.0) internal successors, (2920), 5 states have internal predecessors, (2920), 0 states have call successors, (0), 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-09-01 14:43:44,287 INFO L175 Difference]: Start difference. First operand has 33 places, 35 transitions, 86 flow. Second operand 4 states and 1008 transitions. [2023-09-01 14:43:44,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 158 flow [2023-09-01 14:43:44,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 154 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 14:43:44,289 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 110 flow [2023-09-01 14:43:44,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2023-09-01 14:43:44,289 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-09-01 14:43:44,290 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 110 flow [2023-09-01 14:43:44,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 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-09-01 14:43:44,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:44,291 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] [2023-09-01 14:43:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 14:43:44,291 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 1 more)] === [2023-09-01 14:43:44,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1120690575, now seen corresponding path program 1 times [2023-09-01 14:43:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852514824] [2023-09-01 14:43:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 14:43:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852514824] [2023-09-01 14:43:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852514824] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:43:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:43:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 14:43:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831746221] [2023-09-01 14:43:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:43:44,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 14:43:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:44,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 14:43:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 14:43:44,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 584 [2023-09-01 14:43:44,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 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-09-01 14:43:44,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:44,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 584 [2023-09-01 14:43:44,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:44,868 INFO L130 PetriNetUnfolder]: 1277/1690 cut-off events. [2023-09-01 14:43:44,868 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-09-01 14:43:44,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1690 events. 1277/1690 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6505 event pairs, 264 based on Foata normal form. 1/1003 useless extension candidates. Maximal degree in co-relation 3407. Up to 1016 conditions per place. [2023-09-01 14:43:44,877 INFO L137 encePairwiseOnDemand]: 579/584 looper letters, 51 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2023-09-01 14:43:44,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 271 flow [2023-09-01 14:43:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 14:43:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 14:43:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2023-09-01 14:43:44,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4571917808219178 [2023-09-01 14:43:44,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 801 transitions. [2023-09-01 14:43:44,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 801 transitions. [2023-09-01 14:43:44,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:44,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 801 transitions. [2023-09-01 14:43:44,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-09-01 14:43:44,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 584.0) internal successors, (2336), 4 states have internal predecessors, (2336), 0 states have call successors, (0), 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-09-01 14:43:44,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 584.0) internal successors, (2336), 4 states have internal predecessors, (2336), 0 states have call successors, (0), 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-09-01 14:43:44,887 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 110 flow. Second operand 3 states and 801 transitions. [2023-09-01 14:43:44,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 271 flow [2023-09-01 14:43:44,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 14:43:44,889 INFO L231 Difference]: Finished difference. Result has 38 places, 40 transitions, 135 flow [2023-09-01 14:43:44,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=38, PETRI_TRANSITIONS=40} [2023-09-01 14:43:44,890 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-09-01 14:43:44,891 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 135 flow [2023-09-01 14:43:44,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 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-09-01 14:43:44,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:44,892 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-09-01 14:43:44,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 14:43:44,892 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 1 more)] === [2023-09-01 14:43:44,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1651521349, now seen corresponding path program 1 times [2023-09-01 14:43:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898247167] [2023-09-01 14:43:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898247167] [2023-09-01 14:43:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898247167] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466674489] [2023-09-01 14:43:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:45,053 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-09-01 14:43:45,076 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-09-01 14:43:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:45,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 14:43:45,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:45,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:43:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466674489] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:43:45,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:43:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-09-01 14:43:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954520871] [2023-09-01 14:43:45,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:43:45,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 14:43:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:45,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 14:43:45,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-09-01 14:43:45,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-09-01 14:43:45,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 135 flow. Second operand has 12 states, 12 states have (on average 235.91666666666666) internal successors, (2831), 12 states have internal predecessors, (2831), 0 states have call successors, (0), 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-09-01 14:43:45,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:45,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-09-01 14:43:45,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:46,150 INFO L130 PetriNetUnfolder]: 1914/2647 cut-off events. [2023-09-01 14:43:46,151 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2023-09-01 14:43:46,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 2647 events. 1914/2647 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 11676 event pairs, 666 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 3542. Up to 1262 conditions per place. [2023-09-01 14:43:46,165 INFO L137 encePairwiseOnDemand]: 573/584 looper letters, 87 selfloop transitions, 17 changer transitions 0/106 dead transitions. [2023-09-01 14:43:46,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 106 transitions, 548 flow [2023-09-01 14:43:46,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 14:43:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 14:43:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1961 transitions. [2023-09-01 14:43:46,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197345890410959 [2023-09-01 14:43:46,171 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1961 transitions. [2023-09-01 14:43:46,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1961 transitions. [2023-09-01 14:43:46,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:46,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1961 transitions. [2023-09-01 14:43:46,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 245.125) internal successors, (1961), 8 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:46,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 584.0) internal successors, (5256), 9 states have internal predecessors, (5256), 0 states have call successors, (0), 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-09-01 14:43:46,189 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 584.0) internal successors, (5256), 9 states have internal predecessors, (5256), 0 states have call successors, (0), 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-09-01 14:43:46,189 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 135 flow. Second operand 8 states and 1961 transitions. [2023-09-01 14:43:46,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 106 transitions, 548 flow [2023-09-01 14:43:46,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 106 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 14:43:46,195 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 250 flow [2023-09-01 14:43:46,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2023-09-01 14:43:46,197 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-09-01 14:43:46,197 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 250 flow [2023-09-01 14:43:46,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 235.91666666666666) internal successors, (2831), 12 states have internal predecessors, (2831), 0 states have call successors, (0), 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-09-01 14:43:46,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:46,200 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-09-01 14:43:46,215 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-09-01 14:43:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:46,406 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 1 more)] === [2023-09-01 14:43:46,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1450108102, now seen corresponding path program 1 times [2023-09-01 14:43:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531460928] [2023-09-01 14:43:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531460928] [2023-09-01 14:43:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531460928] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282114184] [2023-09-01 14:43:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:46,643 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-09-01 14:43:46,653 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-09-01 14:43:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:46,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 14:43:46,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:46,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:43:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282114184] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:43:46,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:43:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-09-01 14:43:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529381738] [2023-09-01 14:43:46,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:43:46,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 14:43:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 14:43:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-09-01 14:43:47,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-09-01 14:43:47,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 250 flow. Second operand has 12 states, 12 states have (on average 236.0) internal successors, (2832), 12 states have internal predecessors, (2832), 0 states have call successors, (0), 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-09-01 14:43:47,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:47,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-09-01 14:43:47,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:47,639 INFO L130 PetriNetUnfolder]: 1361/1892 cut-off events. [2023-09-01 14:43:47,640 INFO L131 PetriNetUnfolder]: For 315/337 co-relation queries the response was YES. [2023-09-01 14:43:47,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4626 conditions, 1892 events. 1361/1892 cut-off events. For 315/337 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7843 event pairs, 473 based on Foata normal form. 22/1379 useless extension candidates. Maximal degree in co-relation 4091. Up to 1170 conditions per place. [2023-09-01 14:43:47,651 INFO L137 encePairwiseOnDemand]: 574/584 looper letters, 43 selfloop transitions, 10 changer transitions 34/89 dead transitions. [2023-09-01 14:43:47,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 533 flow [2023-09-01 14:43:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 14:43:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 14:43:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1947 transitions. [2023-09-01 14:43:47,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4167380136986301 [2023-09-01 14:43:47,657 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1947 transitions. [2023-09-01 14:43:47,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1947 transitions. [2023-09-01 14:43:47,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:47,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1947 transitions. [2023-09-01 14:43:47,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 243.375) internal successors, (1947), 8 states have internal predecessors, (1947), 0 states have call successors, (0), 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-09-01 14:43:47,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 584.0) internal successors, (5256), 9 states have internal predecessors, (5256), 0 states have call successors, (0), 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-09-01 14:43:47,668 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 584.0) internal successors, (5256), 9 states have internal predecessors, (5256), 0 states have call successors, (0), 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-09-01 14:43:47,669 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 250 flow. Second operand 8 states and 1947 transitions. [2023-09-01 14:43:47,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 533 flow [2023-09-01 14:43:47,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 512 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-09-01 14:43:47,673 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 202 flow [2023-09-01 14:43:47,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-09-01 14:43:47,674 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-09-01 14:43:47,674 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 202 flow [2023-09-01 14:43:47,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 236.0) internal successors, (2832), 12 states have internal predecessors, (2832), 0 states have call successors, (0), 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-09-01 14:43:47,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:47,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:43:47,687 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-09-01 14:43:47,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:47,882 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 1 more)] === [2023-09-01 14:43:47,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 552953634, now seen corresponding path program 2 times [2023-09-01 14:43:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021852211] [2023-09-01 14:43:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-01 14:43:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021852211] [2023-09-01 14:43:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021852211] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680505918] [2023-09-01 14:43:48,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 14:43:48,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:48,075 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-09-01 14:43:48,078 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-09-01 14:43:48,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 14:43:48,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:43:48,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 14:43:48,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-01 14:43:48,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:43:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-01 14:43:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680505918] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:48,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 14:43:48,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-09-01 14:43:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115913074] [2023-09-01 14:43:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:43:48,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 14:43:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 14:43:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-09-01 14:43:48,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-09-01 14:43:48,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 237.33333333333334) internal successors, (1424), 6 states have internal predecessors, (1424), 0 states have call successors, (0), 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-09-01 14:43:48,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:48,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-09-01 14:43:48,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:48,693 INFO L130 PetriNetUnfolder]: 1547/2085 cut-off events. [2023-09-01 14:43:48,693 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2023-09-01 14:43:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 2085 events. 1547/2085 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8216 event pairs, 465 based on Foata normal form. 0/1677 useless extension candidates. Maximal degree in co-relation 5511. Up to 1568 conditions per place. [2023-09-01 14:43:48,707 INFO L137 encePairwiseOnDemand]: 579/584 looper letters, 55 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-09-01 14:43:48,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 385 flow [2023-09-01 14:43:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 14:43:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 14:43:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1449 transitions. [2023-09-01 14:43:48,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413527397260274 [2023-09-01 14:43:48,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1449 transitions. [2023-09-01 14:43:48,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1449 transitions. [2023-09-01 14:43:48,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:48,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1449 transitions. [2023-09-01 14:43:48,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 0 states have call successors, (0), 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-09-01 14:43:48,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 584.0) internal successors, (4088), 7 states have internal predecessors, (4088), 0 states have call successors, (0), 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-09-01 14:43:48,723 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 584.0) internal successors, (4088), 7 states have internal predecessors, (4088), 0 states have call successors, (0), 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-09-01 14:43:48,724 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 202 flow. Second operand 6 states and 1449 transitions. [2023-09-01 14:43:48,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 385 flow [2023-09-01 14:43:48,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 349 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-09-01 14:43:48,735 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 191 flow [2023-09-01 14:43:48,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-09-01 14:43:48,737 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-09-01 14:43:48,738 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 191 flow [2023-09-01 14:43:48,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.33333333333334) internal successors, (1424), 6 states have internal predecessors, (1424), 0 states have call successors, (0), 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-09-01 14:43:48,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:48,739 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:43:48,747 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-09-01 14:43:48,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:48,945 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 1 more)] === [2023-09-01 14:43:48,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1297932992, now seen corresponding path program 1 times [2023-09-01 14:43:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:48,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667072787] [2023-09-01 14:43:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-01 14:43:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667072787] [2023-09-01 14:43:49,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667072787] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016492444] [2023-09-01 14:43:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:49,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:49,173 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-09-01 14:43:49,200 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-09-01 14:43:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:49,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 14:43:49,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-01 14:43:49,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:43:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-01 14:43:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016492444] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:49,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 14:43:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-09-01 14:43:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532680180] [2023-09-01 14:43:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:43:49,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 14:43:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 14:43:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-09-01 14:43:49,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-09-01 14:43:49,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 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-09-01 14:43:49,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:49,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-09-01 14:43:49,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:49,780 INFO L130 PetriNetUnfolder]: 1146/1548 cut-off events. [2023-09-01 14:43:49,781 INFO L131 PetriNetUnfolder]: For 488/601 co-relation queries the response was YES. [2023-09-01 14:43:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 1548 events. 1146/1548 cut-off events. For 488/601 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5768 event pairs, 281 based on Foata normal form. 163/1370 useless extension candidates. Maximal degree in co-relation 3997. Up to 1015 conditions per place. [2023-09-01 14:43:49,791 INFO L137 encePairwiseOnDemand]: 578/584 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-09-01 14:43:49,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 346 flow [2023-09-01 14:43:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 14:43:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 14:43:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1445 transitions. [2023-09-01 14:43:49,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4123858447488584 [2023-09-01 14:43:49,796 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1445 transitions. [2023-09-01 14:43:49,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1445 transitions. [2023-09-01 14:43:49,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:49,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1445 transitions. [2023-09-01 14:43:49,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.83333333333334) internal successors, (1445), 6 states have internal predecessors, (1445), 0 states have call successors, (0), 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-09-01 14:43:49,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 584.0) internal successors, (4088), 7 states have internal predecessors, (4088), 0 states have call successors, (0), 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-09-01 14:43:49,805 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 584.0) internal successors, (4088), 7 states have internal predecessors, (4088), 0 states have call successors, (0), 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-09-01 14:43:49,805 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 191 flow. Second operand 6 states and 1445 transitions. [2023-09-01 14:43:49,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 346 flow [2023-09-01 14:43:49,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 331 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-09-01 14:43:49,810 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 208 flow [2023-09-01 14:43:49,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-09-01 14:43:49,811 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-09-01 14:43:49,811 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 208 flow [2023-09-01 14:43:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 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-09-01 14:43:49,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:49,812 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:43:49,823 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-09-01 14:43:50,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:50,019 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 1 more)] === [2023-09-01 14:43:50,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2052497291, now seen corresponding path program 1 times [2023-09-01 14:43:50,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37772861] [2023-09-01 14:43:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:43:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37772861] [2023-09-01 14:43:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37772861] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822042274] [2023-09-01 14:43:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:50,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:50,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:50,209 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-09-01 14:43:50,211 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-09-01 14:43:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 14:43:50,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:43:50,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:43:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:43:50,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822042274] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:50,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 14:43:50,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-09-01 14:43:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942309613] [2023-09-01 14:43:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:43:50,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 14:43:50,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 14:43:50,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-09-01 14:43:50,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-09-01 14:43:50,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 237.66666666666666) internal successors, (1426), 6 states have internal predecessors, (1426), 0 states have call successors, (0), 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-09-01 14:43:50,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:50,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-09-01 14:43:50,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:50,820 INFO L130 PetriNetUnfolder]: 991/1364 cut-off events. [2023-09-01 14:43:50,820 INFO L131 PetriNetUnfolder]: For 764/968 co-relation queries the response was YES. [2023-09-01 14:43:50,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1364 events. 991/1364 cut-off events. For 764/968 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4732 event pairs, 318 based on Foata normal form. 272/1348 useless extension candidates. Maximal degree in co-relation 3565. Up to 721 conditions per place. [2023-09-01 14:43:50,830 INFO L137 encePairwiseOnDemand]: 577/584 looper letters, 54 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2023-09-01 14:43:50,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 402 flow [2023-09-01 14:43:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 14:43:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 14:43:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1448 transitions. [2023-09-01 14:43:50,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132420091324201 [2023-09-01 14:43:50,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1448 transitions. [2023-09-01 14:43:50,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1448 transitions. [2023-09-01 14:43:50,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:50,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1448 transitions. [2023-09-01 14:43:50,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.33333333333334) internal successors, (1448), 6 states have internal predecessors, (1448), 0 states have call successors, (0), 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-09-01 14:43:50,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 584.0) internal successors, (4088), 7 states have internal predecessors, (4088), 0 states have call successors, (0), 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-09-01 14:43:50,844 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 584.0) internal successors, (4088), 7 states have internal predecessors, (4088), 0 states have call successors, (0), 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-09-01 14:43:50,844 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 208 flow. Second operand 6 states and 1448 transitions. [2023-09-01 14:43:50,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 402 flow [2023-09-01 14:43:50,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 390 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 14:43:50,849 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 236 flow [2023-09-01 14:43:50,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-09-01 14:43:50,850 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-09-01 14:43:50,850 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 236 flow [2023-09-01 14:43:50,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.66666666666666) internal successors, (1426), 6 states have internal predecessors, (1426), 0 states have call successors, (0), 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-09-01 14:43:50,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:50,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:43:50,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 14:43:51,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:51,058 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 1 more)] === [2023-09-01 14:43:51,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 995945267, now seen corresponding path program 1 times [2023-09-01 14:43:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391349902] [2023-09-01 14:43:51,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:43:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391349902] [2023-09-01 14:43:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391349902] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556486535] [2023-09-01 14:43:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:53,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:53,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:43:53,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 14:43:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:53,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 73 conjunts are in the unsatisfiable core [2023-09-01 14:43:53,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:54,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 14:43:54,134 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:43:54,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-09-01 14:43:54,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:43:54,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-09-01 14:43:54,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:43:54,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-09-01 14:43:54,906 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-09-01 14:43:54,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2023-09-01 14:43:55,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:43:55,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:43:55,213 INFO L321 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-09-01 14:43:55,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 111 [2023-09-01 14:43:57,559 INFO L321 Elim1Store]: treesize reduction 96, result has 75.6 percent of original size [2023-09-01 14:43:57,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 267 treesize of output 447 [2023-09-01 14:44:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-01 14:44:02,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:44:03,147 WARN L839 $PredicateComparison]: unable to prove that (or (<= |c_thread1Thread1of1ForFork0_#t~mem2| c_~mina~0) (let ((.cse2 (+ c_~C~0.offset 4)) (.cse4 (+ c_~mina~0 c_~minb~0)) (.cse3 (+ (* c_thread1Thread1of1ForFork0_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_505 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (let ((.cse0 (select (select .cse1 c_~B~0.base) .cse3))) (or (<= (+ .cse0 c_~mina~0) (select (select .cse1 c_~C~0.base) .cse2)) (< c_~minb~0 .cse0))))) (forall ((v_ArrVal_505 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (or (<= .cse4 (select (select .cse5 c_~C~0.base) .cse2)) (<= (select (select .cse5 c_~B~0.base) .cse3) c_~minb~0)))) (or (<= .cse4 c_~minc~0) (forall ((v_ArrVal_505 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse3) c_~minb~0))) (forall ((v_ArrVal_505 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse3))) (or (<= (+ .cse6 c_~mina~0) c_~minc~0) (< c_~minb~0 .cse6))))))) is different from false [2023-09-01 14:44:03,259 WARN L839 $PredicateComparison]: unable to prove that (or (<= |c_thread1Thread1of1ForFork0_#t~mem2| c_~mina~0) (let ((.cse2 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) (let ((.cse4 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse2 c_~B~0.offset)))) (.cse3 (+ (* c_thread1Thread1of1ForFork0_~i~0 4) c_~B~0.offset)) (.cse7 (+ c_~mina~0 c_~minb~0)) (.cse1 (select |c_#memory_int| c_~C~0.base))) (and (forall ((v_ArrVal_503 Int)) (or (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~C~0.base (store .cse1 (+ ~C~0.offset .cse2) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse3))) (or (<= (+ .cse0 c_~mina~0) c_~minc~0) (< c_~minb~0 .cse0)))) (< v_ArrVal_503 .cse4))) (forall ((v_ArrVal_503 Int)) (or (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| c_~C~0.base (store .cse1 (+ ~C~0.offset .cse2) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (let ((.cse5 (select (select .cse6 c_~B~0.base) .cse3))) (or (<= (+ .cse5 c_~mina~0) (select (select .cse6 c_~C~0.base) (+ ~C~0.offset 4))) (< c_~minb~0 .cse5))))) (< v_ArrVal_503 .cse4))) (or (<= .cse7 c_~minc~0) (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_503 Int)) (or (<= (select (select (store (store |c_#memory_int| c_~C~0.base (store .cse1 (+ ~C~0.offset .cse2) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse3) c_~minb~0) (< v_ArrVal_503 .cse4)))) (forall ((v_ArrVal_503 Int)) (or (< v_ArrVal_503 .cse4) (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| c_~C~0.base (store .cse1 (+ ~C~0.offset .cse2) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (or (<= (select (select .cse8 c_~B~0.base) .cse3) c_~minb~0) (<= .cse7 (select (select .cse8 c_~C~0.base) (+ ~C~0.offset 4)))))))))))) is different from false [2023-09-01 14:44:03,348 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse3 (+ (* c_thread1Thread1of1ForFork0_~i~0 4) c_~B~0.offset)) (.cse6 (+ c_~mina~0 c_~minb~0)) (.cse4 (select |c_#memory_int| c_~C~0.base)) (.cse5 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)) (select (select |c_#memory_int| c_~B~0.base) (+ 4 c_~B~0.offset))))) (and (forall ((v_ArrVal_503 Int)) (or (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse2 (+ ~C~0.offset 4))) (let ((.cse1 (store (store |c_#memory_int| c_~C~0.base (store .cse4 .cse2 v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (let ((.cse0 (select (select .cse1 c_~B~0.base) .cse3))) (or (<= (+ .cse0 c_~mina~0) (select (select .cse1 c_~C~0.base) .cse2)) (< c_~minb~0 .cse0)))))) (< v_ArrVal_503 .cse5))) (or (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_503 Int)) (or (<= (select (select (store (store |c_#memory_int| c_~C~0.base (store .cse4 (+ ~C~0.offset 4) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse3) c_~minb~0) (< v_ArrVal_503 .cse5))) (<= .cse6 c_~minc~0)) (forall ((v_ArrVal_503 Int)) (or (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| c_~C~0.base (store .cse4 (+ ~C~0.offset 4) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse3))) (or (< c_~minb~0 .cse7) (<= (+ .cse7 c_~mina~0) c_~minc~0)))) (< v_ArrVal_503 .cse5))) (forall ((v_ArrVal_503 Int)) (or (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse9 (+ ~C~0.offset 4))) (let ((.cse8 (store (store |c_#memory_int| c_~C~0.base (store .cse4 .cse9 v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (or (<= (select (select .cse8 c_~B~0.base) .cse3) c_~minb~0) (<= .cse6 (select (select .cse8 c_~C~0.base) .cse9)))))) (< v_ArrVal_503 .cse5))))) (<= |c_thread1Thread1of1ForFork0_#t~mem2| c_~mina~0)) is different from false [2023-09-01 14:44:03,503 WARN L839 $PredicateComparison]: unable to prove that (or (<= |c_thread1Thread1of1ForFork0_#t~mem2| c_~mina~0) (let ((.cse0 (+ c_~mina~0 c_~minb~0)) (.cse2 (+ 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset 4)) (.cse4 (+ (* c_thread1Thread1of1ForFork0_~i~0 4) c_~B~0.offset))) (and (or (<= .cse0 c_~minc~0) (forall ((v_ArrVal_502 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_502))) (or (< v_ArrVal_503 (+ (select (select .cse1 c_~B~0.base) .cse2) (select (select .cse1 c_~A~0.base) .cse3))) (<= (select (select (store (store .cse1 c_~C~0.base (store (select .cse1 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse4) c_~minb~0))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_502))) (or (< v_ArrVal_503 (+ (select (select .cse5 c_~B~0.base) .cse2) (select (select .cse5 c_~A~0.base) .cse3))) (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse7 (+ ~C~0.offset 4))) (let ((.cse6 (store (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) .cse7 v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (or (<= (select (select .cse6 c_~B~0.base) .cse4) c_~minb~0) (<= .cse0 (select (select .cse6 c_~C~0.base) .cse7))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_502))) (or (< v_ArrVal_503 (+ (select (select .cse8 c_~B~0.base) .cse2) (select (select .cse8 c_~A~0.base) .cse3))) (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse8 c_~C~0.base (store (select .cse8 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~B~0.base) .cse4))) (or (< c_~minb~0 .cse9) (<= (+ .cse9 c_~mina~0) c_~minc~0))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_502))) (or (< v_ArrVal_503 (+ (select (select .cse10 c_~B~0.base) .cse2) (select (select .cse10 c_~A~0.base) .cse3))) (forall ((~C~0.offset Int) (v_ArrVal_505 (Array Int Int))) (let ((.cse13 (+ ~C~0.offset 4))) (let ((.cse12 (store (store .cse10 c_~C~0.base (store (select .cse10 c_~C~0.base) .cse13 v_ArrVal_503)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505))) (let ((.cse11 (select (select .cse12 c_~B~0.base) .cse4))) (or (< c_~minb~0 .cse11) (<= (+ .cse11 c_~mina~0) (select (select .cse12 c_~C~0.base) .cse13))))))))))))) is different from false [2023-09-01 14:44:03,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:03,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6035 treesize of output 5913 [2023-09-01 14:44:03,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:03,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2837 treesize of output 2804 [2023-09-01 14:44:03,947 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 2773 treesize of output 2677 [2023-09-01 14:44:04,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:04,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2677 treesize of output 2636 [2023-09-01 14:44:04,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:04,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2661 treesize of output 2652 [2023-09-01 14:44:04,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:04,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2621 treesize of output 2428 [2023-09-01 14:44:04,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:04,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2537 treesize of output 2480 [2023-09-01 14:44:04,441 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 2449 treesize of output 2401 [2023-09-01 14:44:04,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:04,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2441 treesize of output 2432 Killed by 15