./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 TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-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 TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 03:54:17,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 03:54:17,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 03:54:17,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 03:54:17,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 03:54:17,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 03:54:17,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 03:54:17,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 03:54:17,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 03:54:17,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 03:54:17,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 03:54:17,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 03:54:17,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 03:54:17,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 03:54:17,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 03:54:17,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 03:54:17,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 03:54:17,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 03:54:17,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 03:54:17,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 03:54:17,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 03:54:17,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 03:54:17,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 03:54:17,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 03:54:17,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 03:54:17,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 03:54:17,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 03:54:17,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 03:54:17,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 03:54:17,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 03:54:17,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 03:54:17,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 03:54:17,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 03:54:17,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 03:54:17,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 03:54:17,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 03:54:17,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 03:54:17,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 03:54:17,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 03:54:17,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 03:54:17,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 03:54:17,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 03:54:17,584 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 03:54:17,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 03:54:17,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 03:54:17,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 03:54:17,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 03:54:17,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 03:54:17,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 03:54:17,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 03:54:17,588 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 03:54:17,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 03:54:17,589 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 03:54:17,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 03:54:17,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 03:54:17,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 03:54:17,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 03:54:17,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 03:54:17,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 03:54:17,590 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 03:54:17,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 03:54:17,591 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 03:54:17,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 03:54:17,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 03:54:17,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 03:54:17,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 03:54:17,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:54:17,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 03:54:17,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 03:54:17,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 03:54:17,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 03:54:17,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 03:54:17,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 03:54:17,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 03:54:17,594 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 03:54:17,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 03:54:17,595 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 03:54:17,595 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 -> TOGETHER [2023-08-31 03:54:17,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 03:54:17,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 03:54:17,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 03:54:17,936 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 03:54:17,937 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 03:54:17,938 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-08-31 03:54:19,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 03:54:19,434 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 03:54:19,434 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-08-31 03:54:19,440 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2dc5ed9/2dfcf7621f1a4e75a26aa8b1298f8299/FLAG228c68ee9 [2023-08-31 03:54:19,452 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2dc5ed9/2dfcf7621f1a4e75a26aa8b1298f8299 [2023-08-31 03:54:19,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 03:54:19,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 03:54:19,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 03:54:19,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 03:54:19,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 03:54:19,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8956f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19, skipping insertion in model container [2023-08-31 03:54:19,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 03:54:19,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 03:54:19,629 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-08-31 03:54:19,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:54:19,661 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 03:54:19,695 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-08-31 03:54:19,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:54:19,721 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 03:54:19,721 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 03:54:19,727 INFO L208 MainTranslator]: Completed translation [2023-08-31 03:54:19,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19 WrapperNode [2023-08-31 03:54:19,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 03:54:19,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 03:54:19,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 03:54:19,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 03:54:19,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,791 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 236 [2023-08-31 03:54:19,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 03:54:19,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 03:54:19,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 03:54:19,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 03:54:19,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 03:54:19,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 03:54:19,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 03:54:19,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 03:54:19,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (1/1) ... [2023-08-31 03:54:19,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:54:19,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:19,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 03:54:19,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 03:54:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 03:54:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 03:54:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 03:54:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 03:54:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 03:54:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 03:54:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 03:54:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 03:54:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 03:54:19,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 03:54:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 03:54:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 03:54:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 03:54:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 03:54:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 03:54:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 03:54:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 03:54:19,955 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 03:54:20,107 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 03:54:20,109 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 03:54:20,553 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 03:54:20,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 03:54:20,626 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-31 03:54:20,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:54:20 BoogieIcfgContainer [2023-08-31 03:54:20,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 03:54:20,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 03:54:20,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 03:54:20,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 03:54:20,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 03:54:19" (1/3) ... [2023-08-31 03:54:20,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12122e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:54:20, skipping insertion in model container [2023-08-31 03:54:20,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:54:19" (2/3) ... [2023-08-31 03:54:20,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12122e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:54:20, skipping insertion in model container [2023-08-31 03:54:20,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:54:20" (3/3) ... [2023-08-31 03:54:20,636 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2023-08-31 03:54:20,642 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 03:54:20,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 03:54:20,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 03:54:20,650 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 03:54:20,723 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 03:54:20,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 284 transitions, 592 flow [2023-08-31 03:54:20,846 INFO L130 PetriNetUnfolder]: 27/281 cut-off events. [2023-08-31 03:54:20,846 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:54:20,852 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-08-31 03:54:20,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 284 transitions, 592 flow [2023-08-31 03:54:20,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 271 transitions, 560 flow [2023-08-31 03:54:20,861 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 03:54:20,870 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 271 transitions, 560 flow [2023-08-31 03:54:20,872 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 271 transitions, 560 flow [2023-08-31 03:54:20,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 271 transitions, 560 flow [2023-08-31 03:54:20,924 INFO L130 PetriNetUnfolder]: 27/271 cut-off events. [2023-08-31 03:54:20,925 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:54:20,926 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-08-31 03:54:20,929 INFO L119 LiptonReduction]: Number of co-enabled transitions 2634 [2023-08-31 03:54:29,246 INFO L134 LiptonReduction]: Checked pairs total: 3780 [2023-08-31 03:54:29,246 INFO L136 LiptonReduction]: Total number of compositions: 300 [2023-08-31 03:54:29,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 03:54:29,267 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;@62daef5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 03:54:29,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 03:54:29,273 INFO L130 PetriNetUnfolder]: 8/33 cut-off events. [2023-08-31 03:54:29,273 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:54:29,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:29,274 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-08-31 03:54:29,274 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-08-31 03:54:29,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash -823952724, now seen corresponding path program 1 times [2023-08-31 03:54:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932568345] [2023-08-31 03:54:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:54:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932568345] [2023-08-31 03:54:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932568345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:54:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:54:29,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:54:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709351414] [2023-08-31 03:54:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:54:29,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:54:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:29,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:54:29,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:54:29,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 584 [2023-08-31 03:54:29,903 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-08-31 03:54:29,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:29,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 584 [2023-08-31 03:54:29,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:30,034 INFO L130 PetriNetUnfolder]: 692/923 cut-off events. [2023-08-31 03:54:30,034 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-31 03:54:30,036 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-08-31 03:54:30,041 INFO L137 encePairwiseOnDemand]: 581/584 looper letters, 30 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-31 03:54:30,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 152 flow [2023-08-31 03:54:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:54:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:54:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2023-08-31 03:54:30,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349315068493151 [2023-08-31 03:54:30,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 762 transitions. [2023-08-31 03:54:30,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 762 transitions. [2023-08-31 03:54:30,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:30,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 762 transitions. [2023-08-31 03:54:30,083 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-08-31 03:54:30,092 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-08-31 03:54:30,094 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-08-31 03:54:30,095 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 86 flow. Second operand 3 states and 762 transitions. [2023-08-31 03:54:30,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 152 flow [2023-08-31 03:54:30,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 03:54:30,103 INFO L231 Difference]: Finished difference. Result has 33 places, 35 transitions, 86 flow [2023-08-31 03:54:30,104 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-08-31 03:54:30,107 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-08-31 03:54:30,107 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 86 flow [2023-08-31 03:54:30,108 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-08-31 03:54:30,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:30,108 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-08-31 03:54:30,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 03:54:30,109 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-08-31 03:54:30,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1618956068, now seen corresponding path program 1 times [2023-08-31 03:54:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225929847] [2023-08-31 03:54:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:54:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225929847] [2023-08-31 03:54:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225929847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:54:30,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:54:30,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 03:54:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95992572] [2023-08-31 03:54:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:54:30,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 03:54:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 03:54:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 03:54:30,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 584 [2023-08-31 03:54:30,300 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-08-31 03:54:30,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:30,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 584 [2023-08-31 03:54:30,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:30,443 INFO L130 PetriNetUnfolder]: 692/925 cut-off events. [2023-08-31 03:54:30,443 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:54:30,444 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-08-31 03:54:30,448 INFO L137 encePairwiseOnDemand]: 577/584 looper letters, 28 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-08-31 03:54:30,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 158 flow [2023-08-31 03:54:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 03:54:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 03:54:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1008 transitions. [2023-08-31 03:54:30,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315068493150685 [2023-08-31 03:54:30,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1008 transitions. [2023-08-31 03:54:30,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1008 transitions. [2023-08-31 03:54:30,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:30,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1008 transitions. [2023-08-31 03:54:30,455 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-08-31 03:54:30,460 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-08-31 03:54:30,462 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-08-31 03:54:30,462 INFO L175 Difference]: Start difference. First operand has 33 places, 35 transitions, 86 flow. Second operand 4 states and 1008 transitions. [2023-08-31 03:54:30,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 158 flow [2023-08-31 03:54:30,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 154 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 03:54:30,464 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 110 flow [2023-08-31 03:54:30,464 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-08-31 03:54:30,465 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-31 03:54:30,465 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 110 flow [2023-08-31 03:54:30,466 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-08-31 03:54:30,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:30,466 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-08-31 03:54:30,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 03:54:30,467 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-08-31 03:54:30,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1120690575, now seen corresponding path program 1 times [2023-08-31 03:54:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301550930] [2023-08-31 03:54:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:54:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:30,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301550930] [2023-08-31 03:54:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301550930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:54:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:54:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:54:30,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778356425] [2023-08-31 03:54:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:54:30,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:54:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:54:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:54:30,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 584 [2023-08-31 03:54:30,831 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-08-31 03:54:30,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:30,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 584 [2023-08-31 03:54:30,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:31,044 INFO L130 PetriNetUnfolder]: 1277/1690 cut-off events. [2023-08-31 03:54:31,044 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-31 03:54:31,046 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-08-31 03:54:31,052 INFO L137 encePairwiseOnDemand]: 579/584 looper letters, 51 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2023-08-31 03:54:31,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 271 flow [2023-08-31 03:54:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:54:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:54:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2023-08-31 03:54:31,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4571917808219178 [2023-08-31 03:54:31,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 801 transitions. [2023-08-31 03:54:31,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 801 transitions. [2023-08-31 03:54:31,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:31,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 801 transitions. [2023-08-31 03:54:31,058 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-08-31 03:54:31,061 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-08-31 03:54:31,063 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-08-31 03:54:31,063 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 110 flow. Second operand 3 states and 801 transitions. [2023-08-31 03:54:31,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 271 flow [2023-08-31 03:54:31,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:54:31,065 INFO L231 Difference]: Finished difference. Result has 38 places, 40 transitions, 135 flow [2023-08-31 03:54:31,065 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-08-31 03:54:31,066 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-31 03:54:31,066 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 135 flow [2023-08-31 03:54:31,067 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-08-31 03:54:31,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:31,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:54:31,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 03:54:31,069 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-08-31 03:54:31,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1651521349, now seen corresponding path program 1 times [2023-08-31 03:54:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868459400] [2023-08-31 03:54:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:31,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:31,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868459400] [2023-08-31 03:54:31,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868459400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180232407] [2023-08-31 03:54:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:31,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:54:31,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 03:54:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:31,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:54:31,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:31,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180232407] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:54:31,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:54:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-31 03:54:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842848268] [2023-08-31 03:54:31,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:54:31,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 03:54:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 03:54:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-31 03:54:31,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-08-31 03:54:31,845 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-08-31 03:54:31,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:31,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-08-31 03:54:31,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:32,318 INFO L130 PetriNetUnfolder]: 1914/2647 cut-off events. [2023-08-31 03:54:32,318 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2023-08-31 03:54:32,322 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-08-31 03:54:32,331 INFO L137 encePairwiseOnDemand]: 573/584 looper letters, 87 selfloop transitions, 17 changer transitions 0/106 dead transitions. [2023-08-31 03:54:32,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 106 transitions, 548 flow [2023-08-31 03:54:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:54:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:54:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1961 transitions. [2023-08-31 03:54:32,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197345890410959 [2023-08-31 03:54:32,337 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1961 transitions. [2023-08-31 03:54:32,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1961 transitions. [2023-08-31 03:54:32,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:32,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1961 transitions. [2023-08-31 03:54:32,342 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-08-31 03:54:32,349 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-08-31 03:54:32,352 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-08-31 03:54:32,352 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 135 flow. Second operand 8 states and 1961 transitions. [2023-08-31 03:54:32,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 106 transitions, 548 flow [2023-08-31 03:54:32,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 106 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:54:32,358 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 250 flow [2023-08-31 03:54:32,358 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-08-31 03:54:32,360 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-08-31 03:54:32,360 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 250 flow [2023-08-31 03:54:32,363 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-08-31 03:54:32,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:32,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:54:32,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-31 03:54:32,568 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-08-31 03:54:32,569 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-08-31 03:54:32,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1450108102, now seen corresponding path program 1 times [2023-08-31 03:54:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179604226] [2023-08-31 03:54:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179604226] [2023-08-31 03:54:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179604226] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:32,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001027331] [2023-08-31 03:54:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:32,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:32,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:54:32,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 03:54:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:32,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:54:32,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:32,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:32,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001027331] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:54:32,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:54:32,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-31 03:54:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423600626] [2023-08-31 03:54:32,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:54:32,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 03:54:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:32,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 03:54:32,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-31 03:54:33,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-08-31 03:54:33,349 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-08-31 03:54:33,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:33,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-08-31 03:54:33,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:33,719 INFO L130 PetriNetUnfolder]: 1361/1892 cut-off events. [2023-08-31 03:54:33,719 INFO L131 PetriNetUnfolder]: For 315/337 co-relation queries the response was YES. [2023-08-31 03:54:33,722 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-08-31 03:54:33,729 INFO L137 encePairwiseOnDemand]: 574/584 looper letters, 43 selfloop transitions, 10 changer transitions 34/89 dead transitions. [2023-08-31 03:54:33,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 533 flow [2023-08-31 03:54:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:54:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:54:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1947 transitions. [2023-08-31 03:54:33,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4167380136986301 [2023-08-31 03:54:33,734 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1947 transitions. [2023-08-31 03:54:33,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1947 transitions. [2023-08-31 03:54:33,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:33,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1947 transitions. [2023-08-31 03:54:33,739 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-08-31 03:54:33,745 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-08-31 03:54:33,746 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-08-31 03:54:33,746 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 250 flow. Second operand 8 states and 1947 transitions. [2023-08-31 03:54:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 533 flow [2023-08-31 03:54:33,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 512 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-31 03:54:33,750 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 202 flow [2023-08-31 03:54:33,750 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-08-31 03:54:33,751 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-08-31 03:54:33,751 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 202 flow [2023-08-31 03:54:33,752 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-08-31 03:54:33,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:33,753 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-08-31 03:54:33,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-31 03:54:33,961 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-08-31 03:54:33,961 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-08-31 03:54:33,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash 552953634, now seen corresponding path program 2 times [2023-08-31 03:54:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:33,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033330246] [2023-08-31 03:54:33,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-31 03:54:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033330246] [2023-08-31 03:54:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033330246] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058236566] [2023-08-31 03:54:34,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:54:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:34,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:54:34,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 03:54:34,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:54:34,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:54:34,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:54:34,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-31 03:54:34,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-31 03:54:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058236566] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:54:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-08-31 03:54:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116570207] [2023-08-31 03:54:34,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:54:34,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 03:54:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:34,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 03:54:34,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-31 03:54:34,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-08-31 03:54:34,477 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-08-31 03:54:34,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:34,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-08-31 03:54:34,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:34,728 INFO L130 PetriNetUnfolder]: 1547/2085 cut-off events. [2023-08-31 03:54:34,729 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2023-08-31 03:54:34,732 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-08-31 03:54:34,740 INFO L137 encePairwiseOnDemand]: 579/584 looper letters, 55 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-31 03:54:34,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 385 flow [2023-08-31 03:54:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 03:54:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 03:54:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1449 transitions. [2023-08-31 03:54:34,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413527397260274 [2023-08-31 03:54:34,745 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1449 transitions. [2023-08-31 03:54:34,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1449 transitions. [2023-08-31 03:54:34,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:34,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1449 transitions. [2023-08-31 03:54:34,749 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-08-31 03:54:34,754 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-08-31 03:54:34,755 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-08-31 03:54:34,756 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 202 flow. Second operand 6 states and 1449 transitions. [2023-08-31 03:54:34,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 385 flow [2023-08-31 03:54:34,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 349 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-31 03:54:34,767 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 191 flow [2023-08-31 03:54:34,767 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-08-31 03:54:34,769 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-31 03:54:34,769 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 191 flow [2023-08-31 03:54:34,770 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-08-31 03:54:34,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:34,771 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-08-31 03:54:34,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-31 03:54:34,976 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-08-31 03:54:34,976 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-08-31 03:54:34,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1297932992, now seen corresponding path program 1 times [2023-08-31 03:54:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321193180] [2023-08-31 03:54:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-31 03:54:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321193180] [2023-08-31 03:54:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321193180] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:35,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613430166] [2023-08-31 03:54:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:35,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:54:35,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 03:54:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:35,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:54:35,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-31 03:54:35,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-31 03:54:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613430166] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:35,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:54:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-08-31 03:54:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732987996] [2023-08-31 03:54:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:54:35,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 03:54:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 03:54:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-31 03:54:35,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-08-31 03:54:35,600 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-08-31 03:54:35,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:35,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-08-31 03:54:35,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:35,782 INFO L130 PetriNetUnfolder]: 1146/1548 cut-off events. [2023-08-31 03:54:35,782 INFO L131 PetriNetUnfolder]: For 488/601 co-relation queries the response was YES. [2023-08-31 03:54:35,785 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-08-31 03:54:35,792 INFO L137 encePairwiseOnDemand]: 578/584 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-31 03:54:35,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 346 flow [2023-08-31 03:54:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 03:54:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 03:54:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1445 transitions. [2023-08-31 03:54:35,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4123858447488584 [2023-08-31 03:54:35,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1445 transitions. [2023-08-31 03:54:35,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1445 transitions. [2023-08-31 03:54:35,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:35,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1445 transitions. [2023-08-31 03:54:35,802 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-08-31 03:54:35,806 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-08-31 03:54:35,807 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-08-31 03:54:35,807 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 191 flow. Second operand 6 states and 1445 transitions. [2023-08-31 03:54:35,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 346 flow [2023-08-31 03:54:35,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 331 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-31 03:54:35,813 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 208 flow [2023-08-31 03:54:35,813 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-08-31 03:54:35,814 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-08-31 03:54:35,814 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 208 flow [2023-08-31 03:54:35,815 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-08-31 03:54:35,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:35,815 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-08-31 03:54:35,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-31 03:54:36,021 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-08-31 03:54:36,021 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-08-31 03:54:36,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2052497291, now seen corresponding path program 1 times [2023-08-31 03:54:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709127343] [2023-08-31 03:54:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:36,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-08-31 03:54:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709127343] [2023-08-31 03:54:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709127343] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199974191] [2023-08-31 03:54:36,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:36,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:36,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:54:36,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 03:54:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:36,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:54:36,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:54:36,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:54:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199974191] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:54:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-08-31 03:54:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382124020] [2023-08-31 03:54:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:54:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 03:54:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 03:54:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-31 03:54:36,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 584 [2023-08-31 03:54:36,623 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-08-31 03:54:36,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:36,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 584 [2023-08-31 03:54:36,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:54:36,816 INFO L130 PetriNetUnfolder]: 991/1364 cut-off events. [2023-08-31 03:54:36,816 INFO L131 PetriNetUnfolder]: For 764/968 co-relation queries the response was YES. [2023-08-31 03:54:36,819 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-08-31 03:54:36,825 INFO L137 encePairwiseOnDemand]: 577/584 looper letters, 54 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2023-08-31 03:54:36,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 402 flow [2023-08-31 03:54:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 03:54:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 03:54:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1448 transitions. [2023-08-31 03:54:36,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132420091324201 [2023-08-31 03:54:36,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1448 transitions. [2023-08-31 03:54:36,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1448 transitions. [2023-08-31 03:54:36,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:54:36,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1448 transitions. [2023-08-31 03:54:36,847 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-08-31 03:54:36,853 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-08-31 03:54:36,854 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-08-31 03:54:36,854 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 208 flow. Second operand 6 states and 1448 transitions. [2023-08-31 03:54:36,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 402 flow [2023-08-31 03:54:36,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 390 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 03:54:36,859 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 236 flow [2023-08-31 03:54:36,859 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-08-31 03:54:36,862 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-08-31 03:54:36,862 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 236 flow [2023-08-31 03:54:36,863 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-08-31 03:54:36,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:36,863 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-08-31 03:54:36,873 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-08-31 03:54:37,068 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-08-31 03:54:37,069 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-08-31 03:54:37,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 995945267, now seen corresponding path program 1 times [2023-08-31 03:54:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69964210] [2023-08-31 03:54:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:54:39,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69964210] [2023-08-31 03:54:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69964210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856497414] [2023-08-31 03:54:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:39,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:39,697 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-08-31 03:54:39,720 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-08-31 03:54:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:39,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-31 03:54:39,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:39,934 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-08-31 03:54:40,036 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:54:40,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 11 treesize of output 11 [2023-08-31 03:54:40,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:40,181 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-08-31 03:54:40,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:54:40,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 03:54:40,781 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-08-31 03:54:40,782 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-08-31 03:54:41,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:54:41,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:54:41,073 INFO L321 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-08-31 03:54:41,074 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-08-31 03:54:43,385 INFO L321 Elim1Store]: treesize reduction 96, result has 75.6 percent of original size [2023-08-31 03:54:43,385 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-08-31 03:54:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-31 03:54:48,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:48,527 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-08-31 03:54:48,620 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-08-31 03:54:48,691 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-08-31 03:54:48,827 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-08-31 03:54:48,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:48,951 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-08-31 03:54:49,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:49,238 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-08-31 03:54:49,315 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-08-31 03:54:49,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:49,409 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-08-31 03:54:49,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:49,522 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-08-31 03:54:49,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:49,628 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-08-31 03:54:49,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:49,757 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-08-31 03:54:49,857 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-08-31 03:54:49,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:49,979 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