./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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-two-queue.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 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 21:42:28,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 21:42:28,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 21:42:28,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 21:42:28,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 21:42:28,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 21:42:28,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 21:42:28,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 21:42:28,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 21:42:28,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 21:42:28,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 21:42:28,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 21:42:28,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 21:42:28,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 21:42:28,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 21:42:28,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 21:42:28,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 21:42:28,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 21:42:28,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 21:42:28,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 21:42:28,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 21:42:28,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 21:42:28,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 21:42:28,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 21:42:28,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 21:42:28,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 21:42:28,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 21:42:28,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 21:42:28,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 21:42:28,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 21:42:28,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 21:42:28,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 21:42:28,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 21:42:28,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 21:42:28,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 21:42:28,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 21:42:28,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 21:42:28,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 21:42:28,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 21:42:28,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 21:42:28,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 21:42:28,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 21:42:28,909 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 21:42:28,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 21:42:28,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 21:42:28,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 21:42:28,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 21:42:28,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 21:42:28,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 21:42:28,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 21:42:28,911 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 21:42:28,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 21:42:28,912 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 21:42:28,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 21:42:28,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 21:42:28,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 21:42:28,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 21:42:28,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 21:42:28,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 21:42:28,913 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 21:42:28,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 21:42:28,914 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 21:42:28,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 21:42:28,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 21:42:28,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 21:42:28,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 21:42:28,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 21:42:28,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 21:42:28,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 21:42:28,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 21:42:28,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 21:42:28,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 21:42:28,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 21:42:28,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 21:42:28,916 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 21:42:28,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 21:42:28,916 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 21:42:28,917 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 -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 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 -> AFTER [2023-08-30 21:42:29,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 21:42:29,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 21:42:29,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 21:42:29,237 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 21:42:29,237 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 21:42:29,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-30 21:42:30,274 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 21:42:30,500 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 21:42:30,500 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-30 21:42:30,508 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b935426cb/c7e773ed68db4a99984dbdf2d920dfe5/FLAG3c5ac398e [2023-08-30 21:42:30,527 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b935426cb/c7e773ed68db4a99984dbdf2d920dfe5 [2023-08-30 21:42:30,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 21:42:30,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 21:42:30,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 21:42:30,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 21:42:30,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 21:42:30,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a90dc0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30, skipping insertion in model container [2023-08-30 21:42:30,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 21:42:30,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 21:42:30,741 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-two-queue.wvr.c[2987,3000] [2023-08-30 21:42:30,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 21:42:30,764 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 21:42:30,798 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-two-queue.wvr.c[2987,3000] [2023-08-30 21:42:30,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 21:42:30,811 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 21:42:30,812 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 21:42:30,818 INFO L208 MainTranslator]: Completed translation [2023-08-30 21:42:30,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30 WrapperNode [2023-08-30 21:42:30,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 21:42:30,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 21:42:30,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 21:42:30,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 21:42:30,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,865 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-08-30 21:42:30,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 21:42:30,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 21:42:30,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 21:42:30,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 21:42:30,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,885 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 21:42:30,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 21:42:30,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 21:42:30,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 21:42:30,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (1/1) ... [2023-08-30 21:42:30,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 21:42:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:42:30,936 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-30 21:42:30,955 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-30 21:42:30,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 21:42:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 21:42:30,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 21:42:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 21:42:30,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 21:42:30,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 21:42:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 21:42:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 21:42:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 21:42:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 21:42:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 21:42:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 21:42:30,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 21:42:30,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 21:42:30,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 21:42:30,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 21:42:31,077 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 21:42:31,080 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 21:42:31,484 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 21:42:31,601 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 21:42:31,601 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 21:42:31,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:42:31 BoogieIcfgContainer [2023-08-30 21:42:31,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 21:42:31,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 21:42:31,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 21:42:31,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 21:42:31,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 09:42:30" (1/3) ... [2023-08-30 21:42:31,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553514b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:42:31, skipping insertion in model container [2023-08-30 21:42:31,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:42:30" (2/3) ... [2023-08-30 21:42:31,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553514b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:42:31, skipping insertion in model container [2023-08-30 21:42:31,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:42:31" (3/3) ... [2023-08-30 21:42:31,610 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-08-30 21:42:31,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 21:42:31,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 21:42:31,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 21:42:31,625 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 21:42:31,679 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 21:42:31,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 356 flow [2023-08-30 21:42:31,829 INFO L130 PetriNetUnfolder]: 13/168 cut-off events. [2023-08-30 21:42:31,829 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 21:42:31,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-08-30 21:42:31,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 170 transitions, 356 flow [2023-08-30 21:42:31,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 160 transitions, 332 flow [2023-08-30 21:42:31,845 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 21:42:31,856 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 160 transitions, 332 flow [2023-08-30 21:42:31,860 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 160 transitions, 332 flow [2023-08-30 21:42:31,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 160 transitions, 332 flow [2023-08-30 21:42:31,904 INFO L130 PetriNetUnfolder]: 13/160 cut-off events. [2023-08-30 21:42:31,905 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 21:42:31,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 13/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-08-30 21:42:31,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-08-30 21:42:36,894 INFO L134 LiptonReduction]: Checked pairs total: 763 [2023-08-30 21:42:36,895 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-30 21:42:36,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 21:42:36,919 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;@393a4c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 21:42:36,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 21:42:36,927 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2023-08-30 21:42:36,928 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 21:42:36,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:36,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:36,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:36,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash 219698779, now seen corresponding path program 1 times [2023-08-30 21:42:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824339467] [2023-08-30 21:42:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:37,430 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-30 21:42:37,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:37,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824339467] [2023-08-30 21:42:37,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824339467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:37,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:37,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 21:42:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646316852] [2023-08-30 21:42:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 21:42:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 21:42:37,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 21:42:37,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-08-30 21:42:37,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-30 21:42:37,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:37,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-08-30 21:42:37,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:37,572 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2023-08-30 21:42:37,572 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 21:42:37,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-08-30 21:42:37,576 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-08-30 21:42:37,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-08-30 21:42:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 21:42:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 21:42:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-30 21:42:37,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750499001996008 [2023-08-30 21:42:37,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-30 21:42:37,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-30 21:42:37,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:37,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-30 21:42:37,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-30 21:42:37,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-30 21:42:37,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-30 21:42:37,618 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 476 transitions. [2023-08-30 21:42:37,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-08-30 21:42:37,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 21:42:37,622 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-08-30 21:42:37,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-08-30 21:42:37,628 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-08-30 21:42:37,628 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-08-30 21:42:37,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-30 21:42:37,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:37,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:37,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 21:42:37,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:37,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1594831125, now seen corresponding path program 1 times [2023-08-30 21:42:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880029918] [2023-08-30 21:42:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:42:37,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:37,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880029918] [2023-08-30 21:42:37,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880029918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:42:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407589958] [2023-08-30 21:42:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:37,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:42:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:42:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:42:37,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-08-30 21:42:37,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-30 21:42:37,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:37,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-08-30 21:42:37,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:37,867 INFO L130 PetriNetUnfolder]: 102/194 cut-off events. [2023-08-30 21:42:37,867 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 21:42:37,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 194 events. 102/194 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 653 event pairs, 9 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 114. Up to 76 conditions per place. [2023-08-30 21:42:37,869 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 41 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-08-30 21:42:37,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 224 flow [2023-08-30 21:42:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 21:42:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 21:42:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2023-08-30 21:42:37,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616766467065868 [2023-08-30 21:42:37,872 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 771 transitions. [2023-08-30 21:42:37,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 771 transitions. [2023-08-30 21:42:37,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:37,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 771 transitions. [2023-08-30 21:42:37,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 0 states have call successors, (0), 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-30 21:42:37,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 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-30 21:42:37,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 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-30 21:42:37,879 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 771 transitions. [2023-08-30 21:42:37,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 224 flow [2023-08-30 21:42:37,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 21:42:37,881 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 99 flow [2023-08-30 21:42:37,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-08-30 21:42:37,882 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-08-30 21:42:37,882 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 99 flow [2023-08-30 21:42:37,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-30 21:42:37,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:37,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:37,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 21:42:37,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:37,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -723769805, now seen corresponding path program 2 times [2023-08-30 21:42:37,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:37,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916105482] [2023-08-30 21:42:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:42:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916105482] [2023-08-30 21:42:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916105482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:42:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941966070] [2023-08-30 21:42:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:37,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:42:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:42:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:42:38,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-08-30 21:42:38,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-30 21:42:38,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:38,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-08-30 21:42:38,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:38,107 INFO L130 PetriNetUnfolder]: 89/165 cut-off events. [2023-08-30 21:42:38,108 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-08-30 21:42:38,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 165 events. 89/165 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 15 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 192. Up to 120 conditions per place. [2023-08-30 21:42:38,111 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 26 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2023-08-30 21:42:38,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 227 flow [2023-08-30 21:42:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 21:42:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 21:42:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2023-08-30 21:42:38,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595808383233533 [2023-08-30 21:42:38,113 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2023-08-30 21:42:38,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2023-08-30 21:42:38,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:38,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2023-08-30 21:42:38,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 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-30 21:42:38,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:42:38,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:42:38,131 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 99 flow. Second operand 4 states and 614 transitions. [2023-08-30 21:42:38,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 227 flow [2023-08-30 21:42:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 21:42:38,133 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 110 flow [2023-08-30 21:42:38,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-08-30 21:42:38,134 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-08-30 21:42:38,135 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 110 flow [2023-08-30 21:42:38,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-30 21:42:38,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:38,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:38,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 21:42:38,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:38,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 521491958, now seen corresponding path program 1 times [2023-08-30 21:42:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672243183] [2023-08-30 21:42:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:42:38,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:38,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672243183] [2023-08-30 21:42:38,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672243183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:38,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:38,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:42:38,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139729680] [2023-08-30 21:42:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:38,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:42:38,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:38,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:42:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:42:38,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-08-30 21:42:38,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-30 21:42:38,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:38,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-08-30 21:42:38,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:38,314 INFO L130 PetriNetUnfolder]: 98/173 cut-off events. [2023-08-30 21:42:38,314 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-08-30 21:42:38,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 173 events. 98/173 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 474 event pairs, 18 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 214. Up to 122 conditions per place. [2023-08-30 21:42:38,316 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-30 21:42:38,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 236 flow [2023-08-30 21:42:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 21:42:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 21:42:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2023-08-30 21:42:38,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538922155688623 [2023-08-30 21:42:38,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2023-08-30 21:42:38,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2023-08-30 21:42:38,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:38,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2023-08-30 21:42:38,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 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-30 21:42:38,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 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-30 21:42:38,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 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-30 21:42:38,330 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 110 flow. Second operand 5 states and 758 transitions. [2023-08-30 21:42:38,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 236 flow [2023-08-30 21:42:38,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 214 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 21:42:38,336 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 112 flow [2023-08-30 21:42:38,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-08-30 21:42:38,337 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-08-30 21:42:38,337 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 112 flow [2023-08-30 21:42:38,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-30 21:42:38,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:38,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:38,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 21:42:38,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:38,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash -44837542, now seen corresponding path program 1 times [2023-08-30 21:42:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:38,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433349082] [2023-08-30 21:42:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:42:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433349082] [2023-08-30 21:42:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433349082] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:42:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886583271] [2023-08-30 21:42:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:38,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:42:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:38,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:42:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:42:38,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 334 [2023-08-30 21:42:38,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 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-30 21:42:38,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:38,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 334 [2023-08-30 21:42:38,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:38,570 INFO L130 PetriNetUnfolder]: 102/188 cut-off events. [2023-08-30 21:42:38,570 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2023-08-30 21:42:38,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 188 events. 102/188 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 61 based on Foata normal form. 8/192 useless extension candidates. Maximal degree in co-relation 308. Up to 174 conditions per place. [2023-08-30 21:42:38,572 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 24 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2023-08-30 21:42:38,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2023-08-30 21:42:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 21:42:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 21:42:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2023-08-30 21:42:38,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476047904191617 [2023-08-30 21:42:38,574 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2023-08-30 21:42:38,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2023-08-30 21:42:38,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:38,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2023-08-30 21:42:38,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 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-30 21:42:38,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:42:38,578 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:42:38,579 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 112 flow. Second operand 4 states and 598 transitions. [2023-08-30 21:42:38,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2023-08-30 21:42:38,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 21:42:38,593 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 120 flow [2023-08-30 21:42:38,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-08-30 21:42:38,594 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2023-08-30 21:42:38,594 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 120 flow [2023-08-30 21:42:38,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 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-30 21:42:38,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:38,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 21:42:38,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:38,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1961656, now seen corresponding path program 1 times [2023-08-30 21:42:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090126153] [2023-08-30 21:42:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 21:42:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090126153] [2023-08-30 21:42:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090126153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 21:42:38,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923240612] [2023-08-30 21:42:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:42:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:42:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:42:38,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 334 [2023-08-30 21:42:38,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 21:42:38,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:38,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 334 [2023-08-30 21:42:38,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:38,774 INFO L130 PetriNetUnfolder]: 99/183 cut-off events. [2023-08-30 21:42:38,774 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-08-30 21:42:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 183 events. 99/183 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 479 event pairs, 59 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 616. Up to 175 conditions per place. [2023-08-30 21:42:38,775 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 25 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-08-30 21:42:38,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 207 flow [2023-08-30 21:42:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 21:42:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 21:42:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2023-08-30 21:42:38,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44610778443113774 [2023-08-30 21:42:38,785 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2023-08-30 21:42:38,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2023-08-30 21:42:38,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:38,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2023-08-30 21:42:38,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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-30 21:42:38,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:42:38,790 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:42:38,790 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 120 flow. Second operand 4 states and 596 transitions. [2023-08-30 21:42:38,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 207 flow [2023-08-30 21:42:38,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 21:42:38,792 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 132 flow [2023-08-30 21:42:38,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-30 21:42:38,793 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2023-08-30 21:42:38,793 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 132 flow [2023-08-30 21:42:38,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 21:42:38,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:38,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:38,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 21:42:38,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:38,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1784763123, now seen corresponding path program 1 times [2023-08-30 21:42:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419958111] [2023-08-30 21:42:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:42:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419958111] [2023-08-30 21:42:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419958111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:42:38,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:42:38,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 21:42:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464234702] [2023-08-30 21:42:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:42:38,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 21:42:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:42:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 21:42:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 21:42:38,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-08-30 21:42:38,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-30 21:42:38,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:42:38,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-08-30 21:42:38,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:42:38,938 INFO L130 PetriNetUnfolder]: 77/140 cut-off events. [2023-08-30 21:42:38,939 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-08-30 21:42:38,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 140 events. 77/140 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 19 based on Foata normal form. 4/143 useless extension candidates. Maximal degree in co-relation 487. Up to 123 conditions per place. [2023-08-30 21:42:38,940 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-30 21:42:38,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 198 flow [2023-08-30 21:42:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 21:42:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 21:42:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-30 21:42:38,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660678642714571 [2023-08-30 21:42:38,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-30 21:42:38,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-30 21:42:38,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:42:38,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-30 21:42:38,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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-30 21:42:38,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-30 21:42:38,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-30 21:42:38,946 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 132 flow. Second operand 3 states and 467 transitions. [2023-08-30 21:42:38,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 198 flow [2023-08-30 21:42:38,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 186 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 21:42:38,947 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 139 flow [2023-08-30 21:42:38,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-30 21:42:38,948 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2023-08-30 21:42:38,948 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 139 flow [2023-08-30 21:42:38,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-30 21:42:38,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:42:38,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:42:38,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 21:42:38,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:42:38,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:42:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 761354163, now seen corresponding path program 2 times [2023-08-30 21:42:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:42:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066275917] [2023-08-30 21:42:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:42:38,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:42:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:42:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:42:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:42:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066275917] [2023-08-30 21:42:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066275917] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:42:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492958757] [2023-08-30 21:42:40,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 21:42:40,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:42:40,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:42:40,089 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-30 21:42:40,106 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-30 21:42:40,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 21:42:40,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:42:40,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-30 21:42:40,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:42:40,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 21:42:40,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:42:40,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:42:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:42:40,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:42:41,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:42:41,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-08-30 21:42:41,590 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-30 21:42:41,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1112 treesize of output 1048 [2023-08-30 21:42:41,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:42:41,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 462 [2023-08-30 21:42:41,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:42:41,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 402 [2023-08-30 21:43:10,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:10,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 80 [2023-08-30 21:43:10,392 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-30 21:43:10,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 550 treesize of output 493 [2023-08-30 21:43:10,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:10,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:10,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:10,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 470 treesize of output 366 [2023-08-30 21:43:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:10,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:10,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:10,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 350 treesize of output 306 [2023-08-30 21:43:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:43:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492958757] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:43:10,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:43:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-08-30 21:43:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656889576] [2023-08-30 21:43:10,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:43:10,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 21:43:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:43:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 21:43:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=760, Unknown=1, NotChecked=0, Total=870 [2023-08-30 21:43:12,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-08-30 21:43:12,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 139 flow. Second operand has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 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-30 21:43:12,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:43:12,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-08-30 21:43:12,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:43:19,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:43:20,654 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2023-08-30 21:43:20,655 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2023-08-30 21:43:20,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 446 events. 244/446 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1739 event pairs, 6 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 1404. Up to 173 conditions per place. [2023-08-30 21:43:20,658 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 76 selfloop transitions, 58 changer transitions 2/136 dead transitions. [2023-08-30 21:43:20,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 907 flow [2023-08-30 21:43:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 21:43:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 21:43:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2316 transitions. [2023-08-30 21:43:20,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25681969394544246 [2023-08-30 21:43:20,664 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2316 transitions. [2023-08-30 21:43:20,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2316 transitions. [2023-08-30 21:43:20,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:43:20,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2316 transitions. [2023-08-30 21:43:20,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.77777777777777) internal successors, (2316), 27 states have internal predecessors, (2316), 0 states have call successors, (0), 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-30 21:43:20,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 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-30 21:43:20,682 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 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-30 21:43:20,682 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 139 flow. Second operand 27 states and 2316 transitions. [2023-08-30 21:43:20,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 907 flow [2023-08-30 21:43:20,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 136 transitions, 887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 21:43:20,687 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 664 flow [2023-08-30 21:43:20,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=664, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-08-30 21:43:20,690 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2023-08-30 21:43:20,690 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 664 flow [2023-08-30 21:43:20,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 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-30 21:43:20,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:43:20,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:43:20,702 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-30 21:43:20,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:43:20,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:43:20,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:43:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1927973413, now seen corresponding path program 3 times [2023-08-30 21:43:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:43:20,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079748653] [2023-08-30 21:43:20,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:43:20,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:43:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:43:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:43:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079748653] [2023-08-30 21:43:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079748653] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:43:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474868786] [2023-08-30 21:43:22,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 21:43:22,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:43:22,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:43:22,068 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-30 21:43:22,074 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-30 21:43:22,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 21:43:22,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:43:22,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-30 21:43:22,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:43:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:22,199 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 21:43:22,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-30 21:43:22,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 21:43:22,333 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:43:22,333 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-30 21:43:22,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 21:43:22,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:43:22,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:43:22,989 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 0 case distinctions, treesize of input 54 treesize of output 20 [2023-08-30 21:43:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:23,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:43:24,399 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-08-30 21:43:24,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 88 [2023-08-30 21:43:24,476 INFO L321 Elim1Store]: treesize reduction 4, result has 94.7 percent of original size [2023-08-30 21:43:24,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 480 treesize of output 499 [2023-08-30 21:43:24,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:24,523 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 154 treesize of output 174 [2023-08-30 21:43:24,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:24,556 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 149 treesize of output 153 [2023-08-30 21:43:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:27,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474868786] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:43:27,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:43:27,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-30 21:43:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101724999] [2023-08-30 21:43:27,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:43:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 21:43:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:43:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 21:43:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1165, Unknown=4, NotChecked=0, Total=1332 [2023-08-30 21:43:29,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-30 21:43:29,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 664 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 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-30 21:43:29,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:43:29,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-30 21:43:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:43:33,424 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~q2_back~0 4)) (.cse41 (* c_~q1_front~0 4)) (.cse17 (+ c_~i~0 1)) (.cse8 (select |c_#memory_int| c_~q2~0.base)) (.cse24 (* c_~q2_front~0 4))) (let ((.cse9 (select .cse8 .cse24)) (.cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (< c_~j~0 .cse17)) (.cse2 (<= c_~n1~0 c_~q1_back~0)) (.cse3 (< c_~q2_back~0 0)) (.cse1 (+ .cse41 c_~q1~0.offset)) (.cse28 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse27 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse6 (< c_~q1_back~0 0)) (.cse12 (<= c_~n2~0 c_~q2_front~0)) (.cse7 (< c_~q2_front~0 0)) (.cse0 (select |c_#memory_int| c_~q1~0.base))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (<= (select .cse0 .cse1) 0) (<= 0 c_~q1_front~0) (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse2 .cse3 (and .cse4 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse5 .cse6 .cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (< c_~q2_front~0 c_~n2~0) (= 0 (select .cse8 0)) (<= 1 c_~N~0) (<= 0 .cse9) (not (= c_~q1~0.base c_~q2~0.base)) (= c_~q2_front~0 0) (<= c_~i~0 c_~N~0) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_75 Int)) (let ((.cse10 (select (select |c_#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_75))))) (and (<= v_~q1_front~0_75 0) (<= c_~i~0 (+ .cse10 1)) (<= 0 v_~q1_front~0_75) (<= .cse10 0) (not (= ~q1~0.base c_~q2~0.base))))) (< .cse9 c_~N~0) (or .cse2 .cse3 .cse11 .cse6 .cse12 .cse7 (let ((.cse16 (+ c_~q2~0.offset .cse24)) (.cse18 (+ .cse23 c_~q2~0.offset))) (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse13 (select .cse19 c_~q1~0.base)) (.cse15 (select .cse19 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse13 .cse14))) (< (select .cse15 .cse16) .cse17) (< (select .cse13 .cse1) c_~i~0) (not (= c_~i~0 (select .cse15 .cse18))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse21 (select .cse22 c_~q1~0.base)) (.cse20 (select .cse22 c_~q2~0.base))) (or (< (select .cse20 .cse16) c_~i~0) (< (select .cse21 .cse1) .cse17) (not (= c_~j~0 (select .cse21 .cse14))) (not (= c_~i~0 (select .cse20 .cse18)))))))))) (or .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse7 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (select .cse29 c_~q1~0.base))) (or (not (= (select .cse25 .cse14) c_~j~0)) (< (select .cse26 .cse27) .cse17) (not (= (select .cse26 .cse28) c_~i~0)) (< (select .cse25 .cse1) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse32 (select .cse34 c_~q1~0.base)) (.cse33 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse32 .cse14) c_~j~0)) (< (select .cse32 .cse1) .cse17) (not (= (select .cse33 .cse28) c_~i~0)) (< (select .cse33 .cse27) c_~i~0)))))))) .cse4 (<= 0 c_~q2_front~0) (<= c_~n2~0 1) (or .cse2 .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse36 (select .cse37 c_~q1~0.base)) (.cse35 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse35 .cse28) c_~i~0)) (not (= (select .cse36 .cse14) c_~j~0)) (< (select .cse36 .cse1) c_~i~0) (< (select .cse35 .cse27) .cse17))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse38 (select .cse40 c_~q1~0.base)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse38 .cse1) .cse17) (not (= (select .cse39 .cse28) c_~i~0)) (not (= (select .cse38 .cse14) c_~j~0)) (< (select .cse39 .cse27) c_~i~0)))))) .cse11 .cse6 .cse12 .cse7) (= (select .cse0 .cse41) 0) (<= c_~q1_front~0 0)))) is different from false [2023-08-30 21:43:34,531 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse40 (* c_~q2_front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~q2~0.base)) (.cse18 (+ c_~q2~0.offset .cse40))) (let ((.cse9 (select |c_#memory_int| c_~q1~0.base)) (.cse19 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse41 (* c_~q2_back~0 4)) (.cse15 (select .cse12 .cse18))) (let ((.cse7 (< .cse15 c_~i~0)) (.cse13 (+ .cse41 c_~q2~0.offset)) (.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (+ c_~i~0 1)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse26 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse14 (select .cse9 .cse19)) (.cse6 (< (+ .cse15 1) c_~N~0)) (.cse8 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (and (< c_~j~0 .cse2) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or (and (or .cse6 .cse7) (or (< c_~i~0 (+ c_~N~0 1)) .cse6)) .cse8 .cse5) (or (not (= (select .cse9 .cse10) c_~j~0)) .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (not (= c_~i~0 (select .cse12 .cse13))) (and (or (< .cse14 .cse2) .cse7) (or (< .cse15 .cse2) (< .cse14 c_~i~0)))) (or .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse20 c_~q1~0.base)) (.cse17 (select .cse20 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse10))) (< (select .cse17 .cse18) .cse2) (< (select .cse16 .cse19) c_~i~0) (not (= c_~i~0 (select .cse17 .cse13))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 c_~q2~0.base))) (or (< (select .cse21 .cse18) c_~i~0) (< (select .cse22 .cse19) .cse2) (not (= c_~j~0 (select .cse22 .cse10))) (not (= c_~i~0 (select .cse21 .cse13))))))))) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse8 .cse5 (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse24 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse24 .cse10) c_~j~0)) (< (select .cse25 .cse26) .cse2) (not (= (select .cse25 .cse27) c_~i~0)) (< (select .cse24 .cse19) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse31 (select .cse33 c_~q1~0.base)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse10) c_~j~0)) (< (select .cse31 .cse19) .cse2) (not (= (select .cse32 .cse27) c_~i~0)) (< (select .cse32 .cse26) c_~i~0)))))))) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse35 (select .cse36 c_~q1~0.base)) (.cse34 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse34 .cse27) c_~i~0)) (not (= (select .cse35 .cse10) c_~j~0)) (< (select .cse35 .cse19) c_~i~0) (< (select .cse34 .cse26) .cse2))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse37 (select .cse39 c_~q1~0.base)) (.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse37 .cse19) .cse2) (not (= (select .cse38 .cse27) c_~i~0)) (not (= (select .cse37 .cse10) c_~j~0)) (< (select .cse38 .cse26) c_~i~0)))))) .cse11 .cse4 .cse8 .cse5) (or (and (or (< .cse15 c_~N~0) (< (+ .cse14 1) c_~N~0)) (or (< .cse14 c_~N~0) .cse6)) .cse8 .cse5)))))) is different from false [2023-08-30 21:43:39,548 INFO L130 PetriNetUnfolder]: 480/896 cut-off events. [2023-08-30 21:43:39,548 INFO L131 PetriNetUnfolder]: For 2679/2679 co-relation queries the response was YES. [2023-08-30 21:43:39,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 896 events. 480/896 cut-off events. For 2679/2679 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4425 event pairs, 28 based on Foata normal form. 6/895 useless extension candidates. Maximal degree in co-relation 3437. Up to 294 conditions per place. [2023-08-30 21:43:39,557 INFO L137 encePairwiseOnDemand]: 320/334 looper letters, 111 selfloop transitions, 179 changer transitions 14/304 dead transitions. [2023-08-30 21:43:39,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 304 transitions, 2689 flow [2023-08-30 21:43:39,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-30 21:43:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-30 21:43:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4451 transitions. [2023-08-30 21:43:39,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24678420935905965 [2023-08-30 21:43:39,579 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4451 transitions. [2023-08-30 21:43:39,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4451 transitions. [2023-08-30 21:43:39,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:43:39,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4451 transitions. [2023-08-30 21:43:39,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 82.42592592592592) internal successors, (4451), 54 states have internal predecessors, (4451), 0 states have call successors, (0), 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-30 21:43:39,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 334.0) internal successors, (18370), 55 states have internal predecessors, (18370), 0 states have call successors, (0), 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-30 21:43:39,623 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 334.0) internal successors, (18370), 55 states have internal predecessors, (18370), 0 states have call successors, (0), 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-30 21:43:39,623 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 664 flow. Second operand 54 states and 4451 transitions. [2023-08-30 21:43:39,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 304 transitions, 2689 flow [2023-08-30 21:43:39,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 304 transitions, 2377 flow, removed 139 selfloop flow, removed 4 redundant places. [2023-08-30 21:43:39,647 INFO L231 Difference]: Finished difference. Result has 132 places, 203 transitions, 1981 flow [2023-08-30 21:43:39,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1981, PETRI_PLACES=132, PETRI_TRANSITIONS=203} [2023-08-30 21:43:39,648 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2023-08-30 21:43:39,648 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 203 transitions, 1981 flow [2023-08-30 21:43:39,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 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-30 21:43:39,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:43:39,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:43:39,658 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-30 21:43:39,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-30 21:43:39,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:43:39,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:43:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1162898149, now seen corresponding path program 4 times [2023-08-30 21:43:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:43:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910530866] [2023-08-30 21:43:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:43:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:43:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:43:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:43:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910530866] [2023-08-30 21:43:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910530866] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:43:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034185848] [2023-08-30 21:43:40,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 21:43:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:43:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:43:40,913 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-30 21:43:40,917 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-30 21:43:41,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 21:43:41,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:43:41,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-30 21:43:41,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:43:41,499 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-08-30 21:43:41,500 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 34 treesize of output 15 [2023-08-30 21:43:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:41,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:43:41,961 INFO L321 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-30 21:43:41,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-08-30 21:43:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034185848] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:43:45,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:43:45,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-30 21:43:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997889998] [2023-08-30 21:43:45,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:43:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 21:43:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:43:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 21:43:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2023-08-30 21:43:47,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 334 [2023-08-30 21:43:47,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 203 transitions, 1981 flow. Second operand has 33 states, 33 states have (on average 109.60606060606061) internal successors, (3617), 33 states have internal predecessors, (3617), 0 states have call successors, (0), 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-30 21:43:47,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:43:47,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 334 [2023-08-30 21:43:47,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:43:52,181 INFO L130 PetriNetUnfolder]: 684/1244 cut-off events. [2023-08-30 21:43:52,181 INFO L131 PetriNetUnfolder]: For 6776/6776 co-relation queries the response was YES. [2023-08-30 21:43:52,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 1244 events. 684/1244 cut-off events. For 6776/6776 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6514 event pairs, 39 based on Foata normal form. 8/1251 useless extension candidates. Maximal degree in co-relation 7075. Up to 378 conditions per place. [2023-08-30 21:43:52,194 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 137 selfloop transitions, 226 changer transitions 6/369 dead transitions. [2023-08-30 21:43:52,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 369 transitions, 4121 flow [2023-08-30 21:43:52,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-30 21:43:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-30 21:43:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4648 transitions. [2023-08-30 21:43:52,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3394187235285526 [2023-08-30 21:43:52,205 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4648 transitions. [2023-08-30 21:43:52,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4648 transitions. [2023-08-30 21:43:52,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:43:52,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4648 transitions. [2023-08-30 21:43:52,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 113.36585365853658) internal successors, (4648), 41 states have internal predecessors, (4648), 0 states have call successors, (0), 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-30 21:43:52,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 0 states have call successors, (0), 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-30 21:43:52,236 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 334.0) internal successors, (14028), 42 states have internal predecessors, (14028), 0 states have call successors, (0), 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-30 21:43:52,236 INFO L175 Difference]: Start difference. First operand has 132 places, 203 transitions, 1981 flow. Second operand 41 states and 4648 transitions. [2023-08-30 21:43:52,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 369 transitions, 4121 flow [2023-08-30 21:43:52,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 369 transitions, 3452 flow, removed 242 selfloop flow, removed 19 redundant places. [2023-08-30 21:43:52,274 INFO L231 Difference]: Finished difference. Result has 158 places, 272 transitions, 2741 flow [2023-08-30 21:43:52,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2741, PETRI_PLACES=158, PETRI_TRANSITIONS=272} [2023-08-30 21:43:52,275 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 136 predicate places. [2023-08-30 21:43:52,276 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 272 transitions, 2741 flow [2023-08-30 21:43:52,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 109.60606060606061) internal successors, (3617), 33 states have internal predecessors, (3617), 0 states have call successors, (0), 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-30 21:43:52,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:43:52,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:43:52,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 21:43:52,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:43:52,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:43:52,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:43:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1006915981, now seen corresponding path program 5 times [2023-08-30 21:43:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:43:52,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184144273] [2023-08-30 21:43:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:43:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:43:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:43:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:43:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184144273] [2023-08-30 21:43:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184144273] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:43:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54367382] [2023-08-30 21:43:53,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 21:43:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:43:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:43:53,599 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-30 21:43:53,605 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-30 21:43:53,702 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 21:43:53,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:43:53,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 21:43:53,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:43:53,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:53,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:43:53,750 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 21:43:53,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-30 21:43:53,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 21:43:53,884 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:43:53,885 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-30 21:43:53,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:43:53,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:43:54,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:43:54,352 INFO L321 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2023-08-30 21:43:54,353 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 60 treesize of output 23 [2023-08-30 21:43:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:43:54,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:43:55,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:55,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 97 [2023-08-30 21:43:55,891 INFO L321 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2023-08-30 21:43:55,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1919 treesize of output 1910 [2023-08-30 21:43:55,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:43:55,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:55,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 475 [2023-08-30 21:43:56,009 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:43:56,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:56,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 484 treesize of output 460 [2023-08-30 21:43:56,060 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:43:56,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:43:56,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 354 treesize of output 378 [2023-08-30 21:44:51,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:44:51,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 97 [2023-08-30 21:44:51,868 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-30 21:44:51,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2551 treesize of output 2511 [2023-08-30 21:44:51,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:44:51,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 483 [2023-08-30 21:44:52,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:44:52,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 492 treesize of output 476 [2023-08-30 21:44:52,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:44:52,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 386 [2023-08-30 21:45:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:45:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54367382] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:45:55,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:45:55,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2023-08-30 21:45:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053842600] [2023-08-30 21:45:55,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:45:55,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 21:45:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:45:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 21:45:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1086, Unknown=12, NotChecked=0, Total=1260 [2023-08-30 21:45:57,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-08-30 21:45:57,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 272 transitions, 2741 flow. Second operand has 36 states, 36 states have (on average 80.47222222222223) internal successors, (2897), 36 states have internal predecessors, (2897), 0 states have call successors, (0), 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-30 21:45:57,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:45:57,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-08-30 21:45:57,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:46:33,675 INFO L130 PetriNetUnfolder]: 952/1778 cut-off events. [2023-08-30 21:46:33,676 INFO L131 PetriNetUnfolder]: For 10817/10817 co-relation queries the response was YES. [2023-08-30 21:46:33,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10335 conditions, 1778 events. 952/1778 cut-off events. For 10817/10817 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10164 event pairs, 42 based on Foata normal form. 50/1827 useless extension candidates. Maximal degree in co-relation 9949. Up to 690 conditions per place. [2023-08-30 21:46:33,692 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 162 selfloop transitions, 305 changer transitions 57/524 dead transitions. [2023-08-30 21:46:33,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 524 transitions, 5744 flow [2023-08-30 21:46:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-08-30 21:46:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2023-08-30 21:46:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 6187 transitions. [2023-08-30 21:46:33,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25032367697038355 [2023-08-30 21:46:33,703 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 6187 transitions. [2023-08-30 21:46:33,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 6187 transitions. [2023-08-30 21:46:33,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:46:33,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 6187 transitions. [2023-08-30 21:46:33,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 83.60810810810811) internal successors, (6187), 74 states have internal predecessors, (6187), 0 states have call successors, (0), 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-30 21:46:33,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 334.0) internal successors, (25050), 75 states have internal predecessors, (25050), 0 states have call successors, (0), 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-30 21:46:33,738 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 334.0) internal successors, (25050), 75 states have internal predecessors, (25050), 0 states have call successors, (0), 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-30 21:46:33,738 INFO L175 Difference]: Start difference. First operand has 158 places, 272 transitions, 2741 flow. Second operand 74 states and 6187 transitions. [2023-08-30 21:46:33,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 524 transitions, 5744 flow [2023-08-30 21:46:33,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 524 transitions, 5551 flow, removed 60 selfloop flow, removed 13 redundant places. [2023-08-30 21:46:33,809 INFO L231 Difference]: Finished difference. Result has 239 places, 350 transitions, 4231 flow [2023-08-30 21:46:33,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2552, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=4231, PETRI_PLACES=239, PETRI_TRANSITIONS=350} [2023-08-30 21:46:33,811 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 217 predicate places. [2023-08-30 21:46:33,811 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 350 transitions, 4231 flow [2023-08-30 21:46:33,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 80.47222222222223) internal successors, (2897), 36 states have internal predecessors, (2897), 0 states have call successors, (0), 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-30 21:46:33,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:46:33,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:46:33,820 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-30 21:46:34,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:46:34,018 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:46:34,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:46:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1834517005, now seen corresponding path program 6 times [2023-08-30 21:46:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:46:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078386818] [2023-08-30 21:46:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:46:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:46:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:46:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:46:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:46:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078386818] [2023-08-30 21:46:34,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078386818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:46:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714560356] [2023-08-30 21:46:34,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 21:46:34,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:46:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:46:34,949 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-30 21:46:34,951 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-30 21:46:35,040 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 21:46:35,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:46:35,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-30 21:46:35,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:46:35,383 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-08-30 21:46:35,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 20 [2023-08-30 21:46:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:46:35,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:46:35,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:46:35,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-08-30 21:46:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:46:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714560356] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:46:52,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:46:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2023-08-30 21:46:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699384325] [2023-08-30 21:46:52,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:46:52,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 21:46:52,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:46:52,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 21:46:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2023-08-30 21:46:55,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 334 [2023-08-30 21:46:55,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 350 transitions, 4231 flow. Second operand has 31 states, 31 states have (on average 109.70967741935483) internal successors, (3401), 31 states have internal predecessors, (3401), 0 states have call successors, (0), 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-30 21:46:55,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:46:55,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 334 [2023-08-30 21:46:55,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:47:21,974 WARN L222 SmtUtils]: Spent 22.14s on a formula simplification. DAG size of input: 88 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:47:23,481 INFO L130 PetriNetUnfolder]: 1260/2316 cut-off events. [2023-08-30 21:47:23,481 INFO L131 PetriNetUnfolder]: For 40307/40307 co-relation queries the response was YES. [2023-08-30 21:47:23,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17240 conditions, 2316 events. 1260/2316 cut-off events. For 40307/40307 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13895 event pairs, 56 based on Foata normal form. 12/2326 useless extension candidates. Maximal degree in co-relation 17041. Up to 773 conditions per place. [2023-08-30 21:47:23,506 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 169 selfloop transitions, 390 changer transitions 17/576 dead transitions. [2023-08-30 21:47:23,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 576 transitions, 8040 flow [2023-08-30 21:47:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-30 21:47:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-30 21:47:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4989 transitions. [2023-08-30 21:47:23,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3394801306477953 [2023-08-30 21:47:23,514 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4989 transitions. [2023-08-30 21:47:23,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4989 transitions. [2023-08-30 21:47:23,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:47:23,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4989 transitions. [2023-08-30 21:47:23,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 113.38636363636364) internal successors, (4989), 44 states have internal predecessors, (4989), 0 states have call successors, (0), 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-30 21:47:23,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 334.0) internal successors, (15030), 45 states have internal predecessors, (15030), 0 states have call successors, (0), 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-30 21:47:23,532 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 334.0) internal successors, (15030), 45 states have internal predecessors, (15030), 0 states have call successors, (0), 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-30 21:47:23,532 INFO L175 Difference]: Start difference. First operand has 239 places, 350 transitions, 4231 flow. Second operand 44 states and 4989 transitions. [2023-08-30 21:47:23,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 576 transitions, 8040 flow [2023-08-30 21:47:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 576 transitions, 7558 flow, removed 162 selfloop flow, removed 27 redundant places. [2023-08-30 21:47:23,714 INFO L231 Difference]: Finished difference. Result has 258 places, 452 transitions, 6351 flow [2023-08-30 21:47:23,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=3820, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=6351, PETRI_PLACES=258, PETRI_TRANSITIONS=452} [2023-08-30 21:47:23,715 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 236 predicate places. [2023-08-30 21:47:23,715 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 452 transitions, 6351 flow [2023-08-30 21:47:23,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 109.70967741935483) internal successors, (3401), 31 states have internal predecessors, (3401), 0 states have call successors, (0), 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-30 21:47:23,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:47:23,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:47:23,724 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-30 21:47:23,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-30 21:47:23,924 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:47:23,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:47:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1645222613, now seen corresponding path program 7 times [2023-08-30 21:47:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:47:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669276353] [2023-08-30 21:47:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:47:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:47:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:47:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:47:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:47:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669276353] [2023-08-30 21:47:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669276353] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:47:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55028381] [2023-08-30 21:47:25,181 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 21:47:25,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:47:25,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:47:25,185 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-30 21:47:25,189 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-30 21:47:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:47:25,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-30 21:47:25,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:47:25,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:47:25,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:47:25,311 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 21:47:25,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-30 21:47:25,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 21:47:25,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:47:25,483 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 21:47:25,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 21:47:25,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 21:47:25,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:47:25,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-08-30 21:47:26,111 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 0 case distinctions, treesize of input 56 treesize of output 20 [2023-08-30 21:47:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:47:26,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:47:26,492 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= (select .cse0 .cse1) c_~j~0)) (< (select .cse0 .cse2) c_~N~0) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0))))) (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse5 (select .cse6 c_~q1~0.base))) (or (not (= (select .cse5 .cse1) c_~j~0)) (< (select (select .cse6 c_~q2~0.base) .cse4) c_~N~0) (< (+ (select .cse5 .cse2) 1) c_~N~0))))))) (< c_~q1_back~0 0)) is different from false [2023-08-30 21:47:26,935 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~q1_back~0 0) (let ((.cse5 (* c_~q2_front~0 4)) (.cse2 (+ c_~i~0 1)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (* c_~q2_back~0 4))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse0 (select .cse4 c_~q1~0.base))) (or (< (select .cse0 .cse1) .cse2) (not (= (select .cse0 .cse3) c_~j~0)) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse9 (select .cse8 c_~q1~0.base))) (or (< (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse2) (not (= (select .cse9 .cse3) c_~j~0)) (< (select .cse9 .cse1) c_~i~0))))) (not (= c_~i~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) is different from false [2023-08-30 21:47:27,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:27,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-30 21:47:27,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:27,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 483 treesize of output 475 [2023-08-30 21:47:27,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:27,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 391 [2023-08-30 21:47:27,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:27,304 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 292 treesize of output 272 [2023-08-30 21:47:27,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:27,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 272 [2023-08-30 21:47:47,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:47,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-30 21:47:47,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:47,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2807 treesize of output 2687 [2023-08-30 21:47:47,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:47,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 281 treesize of output 337 [2023-08-30 21:47:47,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:47,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 257 treesize of output 301 [2023-08-30 21:47:47,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:47:47,556 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 237 treesize of output 217 [2023-08-30 21:47:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 21:47:56,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55028381] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:47:56,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:47:56,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-08-30 21:47:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537607204] [2023-08-30 21:47:56,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:47:56,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 21:47:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:47:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 21:47:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=8, NotChecked=134, Total=1332 [2023-08-30 21:47:56,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-30 21:47:56,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 452 transitions, 6351 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 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-30 21:47:56,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:47:56,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-30 21:47:56,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:47:57,637 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~i~0 1))) (and (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (let ((.cse1 (* c_~q2_back~0 4)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (* c_~q2_front~0 4))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse1 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse4 (select .cse2 c_~q1~0.base))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse4 .cse5) .cse6) (not (= (select .cse4 .cse7) c_~j~0))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (not (= c_~i~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse1 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse9 (select .cse10 c_~q1~0.base))) (or (< (select .cse9 .cse5) c_~i~0) (not (= (select .cse9 .cse7) c_~j~0)) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6))))))))))) (<= c_~i~0 c_~j~0) (< c_~j~0 .cse6))) is different from false [2023-08-30 21:47:59,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 21:47:59,081 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (<= c_~n2~0 c_~q2_back~0)) (.cse3 (< c_~q1_back~0 0)) (.cse7 (* c_~q2_front~0 4)) (.cse10 (+ c_~i~0 1)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (* c_~q2_back~0 4))) (and (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (not (= c_~i~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse8 (select .cse6 c_~q1~0.base))) (or (< (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse8 .cse9) .cse10) (not (= (select .cse8 .cse11) c_~j~0))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (not (= c_~i~0 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse14 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse13 (select .cse14 c_~q1~0.base))) (or (< (select .cse13 .cse9) c_~i~0) (not (= (select .cse13 .cse11) c_~j~0)) (< (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse10)))))))))) (<= c_~i~0 c_~j~0) (< c_~j~0 .cse10) (or .cse0 .cse1 .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse15 (select .cse16 c_~q1~0.base))) (or (< (select .cse15 .cse9) .cse10) (not (= (select .cse15 .cse11) c_~j~0)) (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_367))) (or (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_368))) (let ((.cse19 (select .cse18 c_~q1~0.base))) (or (< (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse7 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse10) (not (= (select .cse19 .cse11) c_~j~0)) (< (select .cse19 .cse9) c_~i~0))))) (not (= c_~i~0 (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))))) is different from false [2023-08-30 21:48:08,307 INFO L130 PetriNetUnfolder]: 1389/2575 cut-off events. [2023-08-30 21:48:08,307 INFO L131 PetriNetUnfolder]: For 64203/64203 co-relation queries the response was YES. [2023-08-30 21:48:08,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21736 conditions, 2575 events. 1389/2575 cut-off events. For 64203/64203 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16048 event pairs, 110 based on Foata normal form. 10/2582 useless extension candidates. Maximal degree in co-relation 21540. Up to 1236 conditions per place. [2023-08-30 21:48:08,331 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 158 selfloop transitions, 449 changer transitions 19/626 dead transitions. [2023-08-30 21:48:08,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 626 transitions, 9674 flow [2023-08-30 21:48:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-30 21:48:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-30 21:48:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4265 transitions. [2023-08-30 21:48:08,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2455665591893137 [2023-08-30 21:48:08,339 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4265 transitions. [2023-08-30 21:48:08,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4265 transitions. [2023-08-30 21:48:08,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:48:08,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4265 transitions. [2023-08-30 21:48:08,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 82.01923076923077) internal successors, (4265), 52 states have internal predecessors, (4265), 0 states have call successors, (0), 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-30 21:48:08,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 334.0) internal successors, (17702), 53 states have internal predecessors, (17702), 0 states have call successors, (0), 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-30 21:48:08,357 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 334.0) internal successors, (17702), 53 states have internal predecessors, (17702), 0 states have call successors, (0), 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-30 21:48:08,358 INFO L175 Difference]: Start difference. First operand has 258 places, 452 transitions, 6351 flow. Second operand 52 states and 4265 transitions. [2023-08-30 21:48:08,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 626 transitions, 9674 flow [2023-08-30 21:48:08,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 626 transitions, 9239 flow, removed 144 selfloop flow, removed 10 redundant places. [2023-08-30 21:48:08,838 INFO L231 Difference]: Finished difference. Result has 305 places, 528 transitions, 8199 flow [2023-08-30 21:48:08,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5992, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=8199, PETRI_PLACES=305, PETRI_TRANSITIONS=528} [2023-08-30 21:48:08,839 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 283 predicate places. [2023-08-30 21:48:08,839 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 528 transitions, 8199 flow [2023-08-30 21:48:08,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 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-30 21:48:08,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:48:08,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:48:08,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 21:48:09,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:48:09,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:48:09,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:48:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash 130363839, now seen corresponding path program 8 times [2023-08-30 21:48:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:48:09,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23801959] [2023-08-30 21:48:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:48:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:48:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:48:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:48:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:48:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23801959] [2023-08-30 21:48:10,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23801959] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:48:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003785576] [2023-08-30 21:48:10,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 21:48:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:48:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:48:10,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:48:10,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 21:48:10,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 21:48:10,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:48:10,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-30 21:48:10,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:48:10,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 21:48:10,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:48:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:48:10,719 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 18 treesize of output 20 [2023-08-30 21:48:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:48:10,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:48:11,101 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) (+ (select (select .cse3 c_~q2~0.base) .cse4) 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (<= (select (select .cse5 c_~q2~0.base) .cse4) (select .cse6 .cse2)) (not (= c_~j~0 (select .cse6 .cse1)))))))))) is different from false [2023-08-30 21:48:11,133 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) (+ (select (select .cse3 c_~q2~0.base) .cse4) 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (<= (select (select .cse5 c_~q2~0.base) .cse4) (select .cse6 .cse2)) (not (= c_~j~0 (select .cse6 .cse1))))))))) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) is different from false [2023-08-30 21:48:11,212 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_409 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_409))) (or (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse0 (select .cse2 ~q1~0.base))) (or (not (= (select .cse0 .cse1) c_~j~0)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select .cse0 .cse4)))))) (not (= c_~i~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)))))) (forall ((v_ArrVal_409 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_409))) (or (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse7 (select .cse8 ~q1~0.base))) (or (< (select .cse7 .cse4) (+ (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) 1)) (not (= (select .cse7 .cse1) c_~j~0)))))) (not (= c_~i~0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)))))))) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0)) is different from false [2023-08-30 21:48:11,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:11,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2023-08-30 21:48:11,307 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-30 21:48:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 990 treesize of output 934 [2023-08-30 21:48:11,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:11,345 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 438 treesize of output 370 [2023-08-30 21:48:11,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:11,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 374 [2023-08-30 21:48:28,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:28,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2023-08-30 21:48:28,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:48:28,096 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-30 21:48:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 306 treesize of output 265 [2023-08-30 21:48:28,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:48:28,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:48:28,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:28,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 242 treesize of output 210 [2023-08-30 21:48:28,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:48:28,126 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 140 [2023-08-30 21:48:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 21:48:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003785576] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:48:28,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:48:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2023-08-30 21:48:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248366353] [2023-08-30 21:48:28,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:48:28,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 21:48:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:48:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 21:48:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=726, Unknown=3, NotChecked=168, Total=992 [2023-08-30 21:48:28,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-08-30 21:48:28,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 528 transitions, 8199 flow. Second operand has 32 states, 32 states have (on average 82.65625) internal successors, (2645), 32 states have internal predecessors, (2645), 0 states have call successors, (0), 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-30 21:48:28,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:48:28,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-08-30 21:48:28,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:48:29,548 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_409 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_409))) (or (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse0 (select .cse2 ~q1~0.base))) (or (not (= (select .cse0 .cse1) c_~j~0)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select .cse0 .cse4)))))) (not (= c_~i~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)))))) (forall ((v_ArrVal_409 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_409))) (or (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse7 (select .cse8 ~q1~0.base))) (or (< (select .cse7 .cse4) (+ (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) 1)) (not (= (select .cse7 .cse1) c_~j~0)))))) (not (= c_~i~0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)))))))) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0)) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1))) is different from false [2023-08-30 21:48:30,240 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q1_back~0 0))) (and (or .cse0 (< c_~q2_back~0 0) (and (<= c_~i~0 c_~j~0) (= c_~q2_front~0 c_~q2_back~0) (< c_~j~0 (+ c_~i~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1) (or .cse0 .cse1 (let ((.cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse2 (select .cse5 ~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) (+ (select (select .cse5 c_~q2~0.base) .cse6) 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410))) (let ((.cse8 (select .cse7 ~q1~0.base))) (or (<= (select (select .cse7 c_~q2~0.base) .cse6) (select .cse8 .cse4)) (not (= c_~j~0 (select .cse8 .cse3)))))))))) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)))) is different from false [2023-08-30 21:48:32,403 INFO L130 PetriNetUnfolder]: 1515/2793 cut-off events. [2023-08-30 21:48:32,404 INFO L131 PetriNetUnfolder]: For 88470/88470 co-relation queries the response was YES. [2023-08-30 21:48:32,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25603 conditions, 2793 events. 1515/2793 cut-off events. For 88470/88470 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 17709 event pairs, 146 based on Foata normal form. 2/2792 useless extension candidates. Maximal degree in co-relation 25363. Up to 1471 conditions per place. [2023-08-30 21:48:32,431 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 287 selfloop transitions, 360 changer transitions 2/649 dead transitions. [2023-08-30 21:48:32,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 649 transitions, 11275 flow [2023-08-30 21:48:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 21:48:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 21:48:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2916 transitions. [2023-08-30 21:48:32,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25678055653399084 [2023-08-30 21:48:32,437 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2916 transitions. [2023-08-30 21:48:32,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2916 transitions. [2023-08-30 21:48:32,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:48:32,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2916 transitions. [2023-08-30 21:48:32,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 85.76470588235294) internal successors, (2916), 34 states have internal predecessors, (2916), 0 states have call successors, (0), 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-30 21:48:32,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 334.0) internal successors, (11690), 35 states have internal predecessors, (11690), 0 states have call successors, (0), 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-30 21:48:32,448 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 334.0) internal successors, (11690), 35 states have internal predecessors, (11690), 0 states have call successors, (0), 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-30 21:48:32,448 INFO L175 Difference]: Start difference. First operand has 305 places, 528 transitions, 8199 flow. Second operand 34 states and 2916 transitions. [2023-08-30 21:48:32,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 649 transitions, 11275 flow [2023-08-30 21:48:32,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 649 transitions, 10941 flow, removed 139 selfloop flow, removed 17 redundant places. [2023-08-30 21:48:32,981 INFO L231 Difference]: Finished difference. Result has 325 places, 576 transitions, 9853 flow [2023-08-30 21:48:32,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7941, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=9853, PETRI_PLACES=325, PETRI_TRANSITIONS=576} [2023-08-30 21:48:32,982 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 303 predicate places. [2023-08-30 21:48:32,982 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 576 transitions, 9853 flow [2023-08-30 21:48:32,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 82.65625) internal successors, (2645), 32 states have internal predecessors, (2645), 0 states have call successors, (0), 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-30 21:48:32,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:48:32,983 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:48:32,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 21:48:33,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:48:33,189 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:48:33,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:48:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1893910212, now seen corresponding path program 9 times [2023-08-30 21:48:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:48:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861055369] [2023-08-30 21:48:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:48:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:48:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:48:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:48:34,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:48:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861055369] [2023-08-30 21:48:34,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861055369] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:48:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485788400] [2023-08-30 21:48:34,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 21:48:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:48:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:48:34,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:48:34,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 21:48:34,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 21:48:34,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:48:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-30 21:48:34,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:48:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:48:35,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:48:35,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:35,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 270 [2023-08-30 21:48:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:48:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485788400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:48:46,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:48:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 29 [2023-08-30 21:48:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849932871] [2023-08-30 21:48:46,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:48:46,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 21:48:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:48:46,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 21:48:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2023-08-30 21:48:48,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 334 [2023-08-30 21:48:48,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 576 transitions, 9853 flow. Second operand has 31 states, 31 states have (on average 109.7741935483871) internal successors, (3403), 31 states have internal predecessors, (3403), 0 states have call successors, (0), 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-30 21:48:48,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:48:48,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 334 [2023-08-30 21:48:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:48:51,033 INFO L130 PetriNetUnfolder]: 1630/3001 cut-off events. [2023-08-30 21:48:51,034 INFO L131 PetriNetUnfolder]: For 91674/91674 co-relation queries the response was YES. [2023-08-30 21:48:51,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28686 conditions, 3001 events. 1630/3001 cut-off events. For 91674/91674 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 19208 event pairs, 205 based on Foata normal form. 3/3001 useless extension candidates. Maximal degree in co-relation 28230. Up to 1958 conditions per place. [2023-08-30 21:48:51,063 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 318 selfloop transitions, 370 changer transitions 5/693 dead transitions. [2023-08-30 21:48:51,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 693 transitions, 13050 flow [2023-08-30 21:48:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-30 21:48:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-30 21:48:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3500 transitions. [2023-08-30 21:48:51,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33803361019895695 [2023-08-30 21:48:51,067 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3500 transitions. [2023-08-30 21:48:51,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3500 transitions. [2023-08-30 21:48:51,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:48:51,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3500 transitions. [2023-08-30 21:48:51,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 112.90322580645162) internal successors, (3500), 31 states have internal predecessors, (3500), 0 states have call successors, (0), 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-30 21:48:51,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 0 states have call successors, (0), 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-30 21:48:51,078 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 0 states have call successors, (0), 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-30 21:48:51,078 INFO L175 Difference]: Start difference. First operand has 325 places, 576 transitions, 9853 flow. Second operand 31 states and 3500 transitions. [2023-08-30 21:48:51,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 693 transitions, 13050 flow [2023-08-30 21:48:51,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 693 transitions, 12880 flow, removed 30 selfloop flow, removed 19 redundant places. [2023-08-30 21:48:51,542 INFO L231 Difference]: Finished difference. Result has 345 places, 625 transitions, 12122 flow [2023-08-30 21:48:51,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=9711, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=12122, PETRI_PLACES=345, PETRI_TRANSITIONS=625} [2023-08-30 21:48:51,543 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 323 predicate places. [2023-08-30 21:48:51,543 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 625 transitions, 12122 flow [2023-08-30 21:48:51,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 109.7741935483871) internal successors, (3403), 31 states have internal predecessors, (3403), 0 states have call successors, (0), 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-30 21:48:51,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:48:51,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:48:51,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-30 21:48:51,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 21:48:51,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:48:51,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:48:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 419130414, now seen corresponding path program 10 times [2023-08-30 21:48:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:48:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080874598] [2023-08-30 21:48:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:48:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:48:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:48:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:48:53,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:48:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080874598] [2023-08-30 21:48:53,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080874598] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:48:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020590959] [2023-08-30 21:48:53,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 21:48:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:48:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:48:53,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:48:53,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 21:48:53,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 21:48:53,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:48:53,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 21:48:53,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:48:53,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:48:53,723 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-08-30 21:48:53,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-30 21:48:53,828 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:48:53,829 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-30 21:48:54,004 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 18 treesize of output 20 [2023-08-30 21:48:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:48:54,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:48:54,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:54,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 288 [2023-08-30 21:48:54,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:54,681 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 191 treesize of output 214 [2023-08-30 21:48:54,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:48:54,712 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 173 treesize of output 178 [2023-08-30 21:48:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:48:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020590959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:48:58,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:48:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 32 [2023-08-30 21:48:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170794409] [2023-08-30 21:48:58,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:48:58,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 21:48:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:48:58,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 21:48:58,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1001, Unknown=1, NotChecked=0, Total=1122 [2023-08-30 21:49:00,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-30 21:49:00,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 625 transitions, 12122 flow. Second operand has 34 states, 34 states have (on average 79.58823529411765) internal successors, (2706), 34 states have internal predecessors, (2706), 0 states have call successors, (0), 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-30 21:49:00,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:49:00,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-30 21:49:00,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:49:14,435 WARN L222 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 99 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:49:16,429 INFO L130 PetriNetUnfolder]: 2026/3699 cut-off events. [2023-08-30 21:49:16,429 INFO L131 PetriNetUnfolder]: For 122984/122984 co-relation queries the response was YES. [2023-08-30 21:49:16,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37965 conditions, 3699 events. 2026/3699 cut-off events. For 122984/122984 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 24540 event pairs, 190 based on Foata normal form. 3/3698 useless extension candidates. Maximal degree in co-relation 37152. Up to 1896 conditions per place. [2023-08-30 21:49:16,461 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 355 selfloop transitions, 494 changer transitions 5/854 dead transitions. [2023-08-30 21:49:16,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 854 transitions, 17825 flow [2023-08-30 21:49:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-30 21:49:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-30 21:49:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3075 transitions. [2023-08-30 21:49:16,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2488266709823596 [2023-08-30 21:49:16,465 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3075 transitions. [2023-08-30 21:49:16,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3075 transitions. [2023-08-30 21:49:16,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:49:16,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3075 transitions. [2023-08-30 21:49:16,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 83.10810810810811) internal successors, (3075), 37 states have internal predecessors, (3075), 0 states have call successors, (0), 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-30 21:49:16,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 334.0) internal successors, (12692), 38 states have internal predecessors, (12692), 0 states have call successors, (0), 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-30 21:49:16,477 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 334.0) internal successors, (12692), 38 states have internal predecessors, (12692), 0 states have call successors, (0), 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-30 21:49:16,477 INFO L175 Difference]: Start difference. First operand has 345 places, 625 transitions, 12122 flow. Second operand 37 states and 3075 transitions. [2023-08-30 21:49:16,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 854 transitions, 17825 flow [2023-08-30 21:49:17,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 854 transitions, 17578 flow, removed 87 selfloop flow, removed 12 redundant places. [2023-08-30 21:49:17,389 INFO L231 Difference]: Finished difference. Result has 379 places, 755 transitions, 16448 flow [2023-08-30 21:49:17,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=11880, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=16448, PETRI_PLACES=379, PETRI_TRANSITIONS=755} [2023-08-30 21:49:17,390 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 357 predicate places. [2023-08-30 21:49:17,390 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 755 transitions, 16448 flow [2023-08-30 21:49:17,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 79.58823529411765) internal successors, (2706), 34 states have internal predecessors, (2706), 0 states have call successors, (0), 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-30 21:49:17,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:49:17,391 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:49:17,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 21:49:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-30 21:49:17,591 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:49:17,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:49:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1886102747, now seen corresponding path program 11 times [2023-08-30 21:49:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:49:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312162990] [2023-08-30 21:49:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:49:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:49:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:49:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:49:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:49:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312162990] [2023-08-30 21:49:18,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312162990] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:49:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578372084] [2023-08-30 21:49:18,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 21:49:18,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:49:18,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:49:18,892 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:49:18,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 21:49:19,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 21:49:19,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:49:19,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-30 21:49:19,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:49:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:49:19,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:49:19,628 INFO L321 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-30 21:49:19,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 216 [2023-08-30 21:49:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:49:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578372084] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:49:21,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:49:21,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 28 [2023-08-30 21:49:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852150597] [2023-08-30 21:49:21,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:49:21,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 21:49:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:49:21,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 21:49:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2023-08-30 21:49:23,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 334 [2023-08-30 21:49:23,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 755 transitions, 16448 flow. Second operand has 30 states, 30 states have (on average 110.8) internal successors, (3324), 30 states have internal predecessors, (3324), 0 states have call successors, (0), 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-30 21:49:23,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:49:23,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 334 [2023-08-30 21:49:23,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:49:27,493 INFO L130 PetriNetUnfolder]: 2278/4172 cut-off events. [2023-08-30 21:49:27,494 INFO L131 PetriNetUnfolder]: For 163132/163132 co-relation queries the response was YES. [2023-08-30 21:49:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46337 conditions, 4172 events. 2278/4172 cut-off events. For 163132/163132 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 28892 event pairs, 229 based on Foata normal form. 80/4252 useless extension candidates. Maximal degree in co-relation 46075. Up to 1520 conditions per place. [2023-08-30 21:49:27,615 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 347 selfloop transitions, 580 changer transitions 36/963 dead transitions. [2023-08-30 21:49:27,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 963 transitions, 22340 flow [2023-08-30 21:49:27,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-30 21:49:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-30 21:49:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5450 transitions. [2023-08-30 21:49:27,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3399451097804391 [2023-08-30 21:49:27,619 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5450 transitions. [2023-08-30 21:49:27,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5450 transitions. [2023-08-30 21:49:27,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:49:27,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5450 transitions. [2023-08-30 21:49:27,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 113.54166666666667) internal successors, (5450), 48 states have internal predecessors, (5450), 0 states have call successors, (0), 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-30 21:49:27,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 334.0) internal successors, (16366), 49 states have internal predecessors, (16366), 0 states have call successors, (0), 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-30 21:49:27,703 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 334.0) internal successors, (16366), 49 states have internal predecessors, (16366), 0 states have call successors, (0), 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-30 21:49:27,703 INFO L175 Difference]: Start difference. First operand has 379 places, 755 transitions, 16448 flow. Second operand 48 states and 5450 transitions. [2023-08-30 21:49:27,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 963 transitions, 22340 flow [2023-08-30 21:49:28,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 963 transitions, 21530 flow, removed 180 selfloop flow, removed 29 redundant places. [2023-08-30 21:49:28,706 INFO L231 Difference]: Finished difference. Result has 390 places, 806 transitions, 19775 flow [2023-08-30 21:49:28,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=14153, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=454, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=19775, PETRI_PLACES=390, PETRI_TRANSITIONS=806} [2023-08-30 21:49:28,707 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 368 predicate places. [2023-08-30 21:49:28,707 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 806 transitions, 19775 flow [2023-08-30 21:49:28,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 110.8) internal successors, (3324), 30 states have internal predecessors, (3324), 0 states have call successors, (0), 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-30 21:49:28,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:49:28,708 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:49:28,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 21:49:28,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 21:49:28,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:49:28,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:49:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 36166084, now seen corresponding path program 12 times [2023-08-30 21:49:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:49:28,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342154868] [2023-08-30 21:49:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:49:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:49:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:49:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-30 21:49:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:49:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342154868] [2023-08-30 21:49:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342154868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:49:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:49:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 21:49:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920764285] [2023-08-30 21:49:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:49:28,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 21:49:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:49:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 21:49:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 21:49:28,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 334 [2023-08-30 21:49:28,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 806 transitions, 19775 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-30 21:49:28,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:49:28,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 334 [2023-08-30 21:49:28,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:49:30,178 INFO L130 PetriNetUnfolder]: 2197/4016 cut-off events. [2023-08-30 21:49:30,178 INFO L131 PetriNetUnfolder]: For 135134/135134 co-relation queries the response was YES. [2023-08-30 21:49:30,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45829 conditions, 4016 events. 2197/4016 cut-off events. For 135134/135134 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 27537 event pairs, 540 based on Foata normal form. 4/4020 useless extension candidates. Maximal degree in co-relation 45624. Up to 3914 conditions per place. [2023-08-30 21:49:30,219 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 779 selfloop transitions, 24 changer transitions 0/803 dead transitions. [2023-08-30 21:49:30,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 803 transitions, 21263 flow [2023-08-30 21:49:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 21:49:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 21:49:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-30 21:49:30,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4620758483033932 [2023-08-30 21:49:30,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-30 21:49:30,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-30 21:49:30,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:49:30,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-30 21:49:30,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-30 21:49:30,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-30 21:49:30,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-30 21:49:30,222 INFO L175 Difference]: Start difference. First operand has 390 places, 806 transitions, 19775 flow. Second operand 3 states and 463 transitions. [2023-08-30 21:49:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 803 transitions, 21263 flow [2023-08-30 21:49:31,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 803 transitions, 20896 flow, removed 162 selfloop flow, removed 14 redundant places. [2023-08-30 21:49:31,199 INFO L231 Difference]: Finished difference. Result has 372 places, 801 transitions, 19329 flow [2023-08-30 21:49:31,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=19281, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=19329, PETRI_PLACES=372, PETRI_TRANSITIONS=801} [2023-08-30 21:49:31,200 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 350 predicate places. [2023-08-30 21:49:31,200 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 801 transitions, 19329 flow [2023-08-30 21:49:31,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-30 21:49:31,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:49:31,201 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:49:31,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 21:49:31,201 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:49:31,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:49:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1445762325, now seen corresponding path program 13 times [2023-08-30 21:49:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:49:31,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9902960] [2023-08-30 21:49:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:49:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:49:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:49:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:49:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:49:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9902960] [2023-08-30 21:49:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9902960] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:49:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344610815] [2023-08-30 21:49:31,304 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 21:49:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:49:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:49:31,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:49:31,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 21:49:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:49:31,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 21:49:31,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:49:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:49:31,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:49:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:49:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344610815] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:49:31,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:49:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 21:49:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915316430] [2023-08-30 21:49:31,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:49:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 21:49:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:49:31,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 21:49:31,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-30 21:49:31,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 334 [2023-08-30 21:49:31,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 801 transitions, 19329 flow. Second operand has 12 states, 12 states have (on average 139.08333333333334) internal successors, (1669), 12 states have internal predecessors, (1669), 0 states have call successors, (0), 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-30 21:49:31,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:49:31,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 334 [2023-08-30 21:49:31,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:49:32,591 INFO L130 PetriNetUnfolder]: 1754/3349 cut-off events. [2023-08-30 21:49:32,591 INFO L131 PetriNetUnfolder]: For 120556/120556 co-relation queries the response was YES. [2023-08-30 21:49:32,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36998 conditions, 3349 events. 1754/3349 cut-off events. For 120556/120556 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 23058 event pairs, 762 based on Foata normal form. 156/3505 useless extension candidates. Maximal degree in co-relation 36875. Up to 1949 conditions per place. [2023-08-30 21:49:32,622 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 583 selfloop transitions, 26 changer transitions 6/615 dead transitions. [2023-08-30 21:49:32,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 615 transitions, 15579 flow [2023-08-30 21:49:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 21:49:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 21:49:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2023-08-30 21:49:32,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276447105788423 [2023-08-30 21:49:32,623 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2023-08-30 21:49:32,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2023-08-30 21:49:32,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:49:32,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2023-08-30 21:49:32,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 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-30 21:49:32,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 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-30 21:49:32,625 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 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-30 21:49:32,626 INFO L175 Difference]: Start difference. First operand has 372 places, 801 transitions, 19329 flow. Second operand 6 states and 857 transitions. [2023-08-30 21:49:32,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 615 transitions, 15579 flow [2023-08-30 21:49:33,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 615 transitions, 15034 flow, removed 65 selfloop flow, removed 15 redundant places. [2023-08-30 21:49:33,215 INFO L231 Difference]: Finished difference. Result has 335 places, 575 transitions, 13200 flow [2023-08-30 21:49:33,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=13119, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13200, PETRI_PLACES=335, PETRI_TRANSITIONS=575} [2023-08-30 21:49:33,216 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 313 predicate places. [2023-08-30 21:49:33,216 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 575 transitions, 13200 flow [2023-08-30 21:49:33,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 139.08333333333334) internal successors, (1669), 12 states have internal predecessors, (1669), 0 states have call successors, (0), 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-30 21:49:33,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:49:33,217 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:49:33,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-30 21:49:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:49:33,417 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:49:33,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:49:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1411502774, now seen corresponding path program 14 times [2023-08-30 21:49:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:49:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247938161] [2023-08-30 21:49:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:49:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:49:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:49:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:49:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:49:33,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247938161] [2023-08-30 21:49:33,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247938161] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:49:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357516859] [2023-08-30 21:49:33,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 21:49:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:49:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:49:33,521 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:49:33,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 21:49:33,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 21:49:33,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:49:33,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 21:49:33,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:49:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:49:33,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:49:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:49:33,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357516859] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:49:33,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:49:33,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-30 21:49:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85800768] [2023-08-30 21:49:33,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:49:33,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 21:49:33,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:49:33,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 21:49:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-30 21:49:33,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 334 [2023-08-30 21:49:33,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 575 transitions, 13200 flow. Second operand has 12 states, 12 states have (on average 138.75) internal successors, (1665), 12 states have internal predecessors, (1665), 0 states have call successors, (0), 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-30 21:49:33,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:49:33,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 334 [2023-08-30 21:49:33,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:49:34,418 INFO L130 PetriNetUnfolder]: 1231/2486 cut-off events. [2023-08-30 21:49:34,418 INFO L131 PetriNetUnfolder]: For 76533/76533 co-relation queries the response was YES. [2023-08-30 21:49:34,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25223 conditions, 2486 events. 1231/2486 cut-off events. For 76533/76533 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 16965 event pairs, 535 based on Foata normal form. 173/2659 useless extension candidates. Maximal degree in co-relation 25141. Up to 1507 conditions per place. [2023-08-30 21:49:34,441 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 403 selfloop transitions, 13 changer transitions 31/447 dead transitions. [2023-08-30 21:49:34,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 447 transitions, 10519 flow [2023-08-30 21:49:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 21:49:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 21:49:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2023-08-30 21:49:34,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276447105788423 [2023-08-30 21:49:34,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2023-08-30 21:49:34,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2023-08-30 21:49:34,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:49:34,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2023-08-30 21:49:34,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 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-30 21:49:34,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 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-30 21:49:34,445 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 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-30 21:49:34,445 INFO L175 Difference]: Start difference. First operand has 335 places, 575 transitions, 13200 flow. Second operand 6 states and 857 transitions. [2023-08-30 21:49:34,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 447 transitions, 10519 flow [2023-08-30 21:49:34,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 447 transitions, 9599 flow, removed 84 selfloop flow, removed 25 redundant places. [2023-08-30 21:49:34,806 INFO L231 Difference]: Finished difference. Result has 290 places, 369 transitions, 7430 flow [2023-08-30 21:49:34,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7894, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7430, PETRI_PLACES=290, PETRI_TRANSITIONS=369} [2023-08-30 21:49:34,806 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 268 predicate places. [2023-08-30 21:49:34,807 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 369 transitions, 7430 flow [2023-08-30 21:49:34,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 138.75) internal successors, (1665), 12 states have internal predecessors, (1665), 0 states have call successors, (0), 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-30 21:49:34,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:49:34,807 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:49:34,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-30 21:49:35,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:49:35,013 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:49:35,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:49:35,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1843840762, now seen corresponding path program 15 times [2023-08-30 21:49:35,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:49:35,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661984956] [2023-08-30 21:49:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:49:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:49:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:49:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:49:38,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:49:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661984956] [2023-08-30 21:49:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661984956] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:49:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109226458] [2023-08-30 21:49:38,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 21:49:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:49:38,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:49:38,055 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:49:38,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 21:49:38,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 21:49:38,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:49:38,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 21:49:38,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:49:38,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:49:38,471 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 29 treesize of output 29 [2023-08-30 21:49:38,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:49:38,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 40 [2023-08-30 21:49:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 21:49:38,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:49:39,062 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse3 (* c_~q1_back~0 4)) (.cse4 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_689 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_689))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (not (= c_~j~0 (select .cse2 (+ .cse3 ~q1~0.offset)))) (< (+ (select .cse2 (+ .cse4 ~q1~0.offset)) 1) c_~N~0))))))) (forall ((v_ArrVal_689 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_689))) (or (< (+ (select (select .cse5 c_~q2~0.base) .cse1) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (not (= c_~j~0 (select .cse6 (+ .cse3 ~q1~0.offset)))) (< (select .cse6 (+ .cse4 ~q1~0.offset)) c_~N~0))))))))) is different from false [2023-08-30 21:49:39,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:49:39,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-08-30 21:49:39,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:49:39,211 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 143 treesize of output 166 [2023-08-30 21:49:39,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:49:39,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 125 treesize of output 148 [2023-08-30 21:51:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 21:51:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109226458] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:51:01,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:51:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 34 [2023-08-30 21:51:01,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947354291] [2023-08-30 21:51:01,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:51:01,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 21:51:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:51:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 21:51:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1092, Unknown=1, NotChecked=66, Total=1260 [2023-08-30 21:51:01,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-30 21:51:01,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 369 transitions, 7430 flow. Second operand has 36 states, 36 states have (on average 79.55555555555556) internal successors, (2864), 36 states have internal predecessors, (2864), 0 states have call successors, (0), 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-30 21:51:01,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:51:01,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-30 21:51:01,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:51:04,695 INFO L130 PetriNetUnfolder]: 1461/2851 cut-off events. [2023-08-30 21:51:04,695 INFO L131 PetriNetUnfolder]: For 60477/60477 co-relation queries the response was YES. [2023-08-30 21:51:04,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27110 conditions, 2851 events. 1461/2851 cut-off events. For 60477/60477 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 19462 event pairs, 154 based on Foata normal form. 6/2857 useless extension candidates. Maximal degree in co-relation 27040. Up to 1457 conditions per place. [2023-08-30 21:51:04,718 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 161 selfloop transitions, 375 changer transitions 9/545 dead transitions. [2023-08-30 21:51:04,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 545 transitions, 11706 flow [2023-08-30 21:51:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 21:51:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 21:51:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2875 transitions. [2023-08-30 21:51:04,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24593669803250642 [2023-08-30 21:51:04,727 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2875 transitions. [2023-08-30 21:51:04,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2875 transitions. [2023-08-30 21:51:04,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:51:04,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2875 transitions. [2023-08-30 21:51:04,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 82.14285714285714) internal successors, (2875), 35 states have internal predecessors, (2875), 0 states have call successors, (0), 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-30 21:51:04,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 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-30 21:51:04,737 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 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-30 21:51:04,737 INFO L175 Difference]: Start difference. First operand has 290 places, 369 transitions, 7430 flow. Second operand 35 states and 2875 transitions. [2023-08-30 21:51:04,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 545 transitions, 11706 flow [2023-08-30 21:51:05,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 545 transitions, 11452 flow, removed 85 selfloop flow, removed 17 redundant places. [2023-08-30 21:51:05,053 INFO L231 Difference]: Finished difference. Result has 287 places, 485 transitions, 10992 flow [2023-08-30 21:51:05,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7304, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=10992, PETRI_PLACES=287, PETRI_TRANSITIONS=485} [2023-08-30 21:51:05,054 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 265 predicate places. [2023-08-30 21:51:05,054 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 485 transitions, 10992 flow [2023-08-30 21:51:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 79.55555555555556) internal successors, (2864), 36 states have internal predecessors, (2864), 0 states have call successors, (0), 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-30 21:51:05,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:51:05,055 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:51:05,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-30 21:51:05,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-30 21:51:05,261 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:51:05,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:51:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1997001506, now seen corresponding path program 16 times [2023-08-30 21:51:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:51:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301625558] [2023-08-30 21:51:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:51:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:51:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:51:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 21:51:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:51:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301625558] [2023-08-30 21:51:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301625558] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:51:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610221850] [2023-08-30 21:51:05,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 21:51:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:51:05,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:51:05,351 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:51:05,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 21:51:05,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 21:51:05,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:51:05,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 21:51:05,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:51:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 21:51:05,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:51:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 21:51:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610221850] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:51:05,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:51:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 8 [2023-08-30 21:51:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348450469] [2023-08-30 21:51:05,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:51:05,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 21:51:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:51:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 21:51:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-30 21:51:05,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 334 [2023-08-30 21:51:05,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 485 transitions, 10992 flow. Second operand has 9 states, 9 states have (on average 151.55555555555554) internal successors, (1364), 9 states have internal predecessors, (1364), 0 states have call successors, (0), 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-30 21:51:05,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:51:05,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 334 [2023-08-30 21:51:05,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:51:06,095 INFO L130 PetriNetUnfolder]: 1345/2715 cut-off events. [2023-08-30 21:51:06,095 INFO L131 PetriNetUnfolder]: For 66840/66840 co-relation queries the response was YES. [2023-08-30 21:51:06,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27251 conditions, 2715 events. 1345/2715 cut-off events. For 66840/66840 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 18785 event pairs, 457 based on Foata normal form. 132/2847 useless extension candidates. Maximal degree in co-relation 27182. Up to 1316 conditions per place. [2023-08-30 21:51:06,115 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 272 selfloop transitions, 115 changer transitions 95/482 dead transitions. [2023-08-30 21:51:06,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 482 transitions, 12074 flow [2023-08-30 21:51:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 21:51:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 21:51:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 625 transitions. [2023-08-30 21:51:06,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46781437125748504 [2023-08-30 21:51:06,118 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 625 transitions. [2023-08-30 21:51:06,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 625 transitions. [2023-08-30 21:51:06,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:51:06,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 625 transitions. [2023-08-30 21:51:06,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 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-30 21:51:06,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:51:06,120 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-30 21:51:06,120 INFO L175 Difference]: Start difference. First operand has 287 places, 485 transitions, 10992 flow. Second operand 4 states and 625 transitions. [2023-08-30 21:51:06,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 482 transitions, 12074 flow [2023-08-30 21:51:06,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 482 transitions, 11683 flow, removed 147 selfloop flow, removed 11 redundant places. [2023-08-30 21:51:06,515 INFO L231 Difference]: Finished difference. Result has 275 places, 347 transitions, 8612 flow [2023-08-30 21:51:06,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=9464, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8612, PETRI_PLACES=275, PETRI_TRANSITIONS=347} [2023-08-30 21:51:06,516 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 253 predicate places. [2023-08-30 21:51:06,516 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 347 transitions, 8612 flow [2023-08-30 21:51:06,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 151.55555555555554) internal successors, (1364), 9 states have internal predecessors, (1364), 0 states have call successors, (0), 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-30 21:51:06,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:51:06,516 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:51:06,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 21:51:06,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:51:06,717 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:51:06,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:51:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1764554269, now seen corresponding path program 17 times [2023-08-30 21:51:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:51:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570309966] [2023-08-30 21:51:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:51:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:51:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:51:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:51:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:51:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570309966] [2023-08-30 21:51:08,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570309966] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:51:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141430249] [2023-08-30 21:51:08,094 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 21:51:08,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:51:08,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:51:08,095 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:51:08,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 21:51:08,198 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 21:51:08,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:51:08,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-30 21:51:08,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:51:08,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:51:08,524 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 25 treesize of output 25 [2023-08-30 21:51:08,754 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-08-30 21:51:08,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 20 [2023-08-30 21:51:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:51:08,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:51:09,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:51:09,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-08-30 21:51:09,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:51:09,420 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 143 treesize of output 166 [2023-08-30 21:51:09,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:51:09,449 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 125 treesize of output 148 [2023-08-30 21:51:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 21:51:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141430249] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:51:56,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:51:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 39 [2023-08-30 21:51:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846496096] [2023-08-30 21:51:56,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:51:56,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-30 21:51:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:51:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-30 21:51:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1477, Unknown=10, NotChecked=0, Total=1640 [2023-08-30 21:51:56,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 334 [2023-08-30 21:51:56,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 347 transitions, 8612 flow. Second operand has 41 states, 41 states have (on average 84.4390243902439) internal successors, (3462), 41 states have internal predecessors, (3462), 0 states have call successors, (0), 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-30 21:51:56,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:51:56,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 334 [2023-08-30 21:51:56,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:52:00,158 INFO L130 PetriNetUnfolder]: 1142/2248 cut-off events. [2023-08-30 21:52:00,159 INFO L131 PetriNetUnfolder]: For 56589/56589 co-relation queries the response was YES. [2023-08-30 21:52:00,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23007 conditions, 2248 events. 1142/2248 cut-off events. For 56589/56589 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14533 event pairs, 102 based on Foata normal form. 24/2272 useless extension candidates. Maximal degree in co-relation 22938. Up to 996 conditions per place. [2023-08-30 21:52:00,176 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 105 selfloop transitions, 348 changer transitions 22/475 dead transitions. [2023-08-30 21:52:00,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 475 transitions, 11297 flow [2023-08-30 21:52:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-30 21:52:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-30 21:52:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3310 transitions. [2023-08-30 21:52:00,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2607942010715411 [2023-08-30 21:52:00,181 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3310 transitions. [2023-08-30 21:52:00,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3310 transitions. [2023-08-30 21:52:00,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:52:00,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3310 transitions. [2023-08-30 21:52:00,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 87.10526315789474) internal successors, (3310), 38 states have internal predecessors, (3310), 0 states have call successors, (0), 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-30 21:52:00,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 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-30 21:52:00,191 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 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-30 21:52:00,191 INFO L175 Difference]: Start difference. First operand has 275 places, 347 transitions, 8612 flow. Second operand 38 states and 3310 transitions. [2023-08-30 21:52:00,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 475 transitions, 11297 flow [2023-08-30 21:52:00,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 475 transitions, 10673 flow, removed 71 selfloop flow, removed 26 redundant places. [2023-08-30 21:52:00,397 INFO L231 Difference]: Finished difference. Result has 258 places, 394 transitions, 9961 flow [2023-08-30 21:52:00,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=8003, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=9961, PETRI_PLACES=258, PETRI_TRANSITIONS=394} [2023-08-30 21:52:00,398 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 236 predicate places. [2023-08-30 21:52:00,398 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 394 transitions, 9961 flow [2023-08-30 21:52:00,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 84.4390243902439) internal successors, (3462), 41 states have internal predecessors, (3462), 0 states have call successors, (0), 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-30 21:52:00,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:52:00,398 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:52:00,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 21:52:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:52:00,599 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:52:00,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:52:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1779404822, now seen corresponding path program 18 times [2023-08-30 21:52:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:52:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430487117] [2023-08-30 21:52:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:52:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:52:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:52:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 21:52:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:52:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430487117] [2023-08-30 21:52:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430487117] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:52:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969777625] [2023-08-30 21:52:00,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 21:52:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:52:00,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:52:00,688 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:52:00,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-30 21:52:00,912 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 21:52:00,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:52:00,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 21:52:00,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:52:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:52:01,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:52:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:52:01,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969777625] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:52:01,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:52:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 16 [2023-08-30 21:52:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270428541] [2023-08-30 21:52:01,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:52:01,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 21:52:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:52:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 21:52:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-08-30 21:52:01,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 334 [2023-08-30 21:52:01,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 394 transitions, 9961 flow. Second operand has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-30 21:52:01,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:52:01,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 334 [2023-08-30 21:52:01,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:52:01,822 INFO L130 PetriNetUnfolder]: 932/1959 cut-off events. [2023-08-30 21:52:01,822 INFO L131 PetriNetUnfolder]: For 55572/55572 co-relation queries the response was YES. [2023-08-30 21:52:01,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19760 conditions, 1959 events. 932/1959 cut-off events. For 55572/55572 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12409 event pairs, 235 based on Foata normal form. 200/2159 useless extension candidates. Maximal degree in co-relation 19697. Up to 717 conditions per place. [2023-08-30 21:52:01,836 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 189 selfloop transitions, 84 changer transitions 116/389 dead transitions. [2023-08-30 21:52:01,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 389 transitions, 9983 flow [2023-08-30 21:52:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 21:52:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 21:52:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1407 transitions. [2023-08-30 21:52:01,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212574850299401 [2023-08-30 21:52:01,837 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1407 transitions. [2023-08-30 21:52:01,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1407 transitions. [2023-08-30 21:52:01,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:52:01,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1407 transitions. [2023-08-30 21:52:01,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 140.7) internal successors, (1407), 10 states have internal predecessors, (1407), 0 states have call successors, (0), 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-30 21:52:01,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 334.0) internal successors, (3674), 11 states have internal predecessors, (3674), 0 states have call successors, (0), 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-30 21:52:01,840 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 334.0) internal successors, (3674), 11 states have internal predecessors, (3674), 0 states have call successors, (0), 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-30 21:52:01,840 INFO L175 Difference]: Start difference. First operand has 258 places, 394 transitions, 9961 flow. Second operand 10 states and 1407 transitions. [2023-08-30 21:52:01,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 389 transitions, 9983 flow [2023-08-30 21:52:01,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 389 transitions, 9434 flow, removed 71 selfloop flow, removed 21 redundant places. [2023-08-30 21:52:01,997 INFO L231 Difference]: Finished difference. Result has 241 places, 236 transitions, 5752 flow [2023-08-30 21:52:01,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=7359, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5752, PETRI_PLACES=241, PETRI_TRANSITIONS=236} [2023-08-30 21:52:01,998 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 219 predicate places. [2023-08-30 21:52:01,998 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 236 transitions, 5752 flow [2023-08-30 21:52:01,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-30 21:52:01,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:52:01,999 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:52:02,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 21:52:02,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-30 21:52:02,215 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:52:02,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:52:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash 665325162, now seen corresponding path program 19 times [2023-08-30 21:52:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:52:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817394025] [2023-08-30 21:52:02,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:52:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:52:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:52:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:52:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:52:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817394025] [2023-08-30 21:52:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817394025] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:52:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655264444] [2023-08-30 21:52:04,149 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 21:52:04,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:52:04,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:52:04,150 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:52:04,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 21:52:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:52:04,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-30 21:52:04,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:52:04,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:52:04,535 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 29 treesize of output 29 [2023-08-30 21:52:04,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:04,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 40 [2023-08-30 21:52:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 21:52:04,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:52:05,071 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_879 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_879))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (< (+ (select .cse2 (+ .cse3 ~q1~0.offset)) 1) c_~N~0) (not (= (select .cse2 (+ .cse4 ~q1~0.offset)) c_~j~0)))))))) (forall ((v_ArrVal_879 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_879))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (< (select .cse5 (+ .cse3 ~q1~0.offset)) c_~N~0) (not (= (select .cse5 (+ .cse4 ~q1~0.offset)) c_~j~0))))) (< (+ (select (select .cse6 c_~q2~0.base) .cse1) 1) c_~N~0)))))) is different from false [2023-08-30 21:52:05,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:05,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-08-30 21:52:05,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:05,210 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 143 treesize of output 166 [2023-08-30 21:52:05,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:05,237 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 125 treesize of output 148 [2023-08-30 21:52:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 21:52:32,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655264444] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:52:32,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:52:32,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 38 [2023-08-30 21:52:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926776940] [2023-08-30 21:52:32,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:52:32,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-30 21:52:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:52:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-30 21:52:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1327, Unknown=1, NotChecked=74, Total=1560 [2023-08-30 21:52:32,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 334 [2023-08-30 21:52:32,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 236 transitions, 5752 flow. Second operand has 40 states, 40 states have (on average 84.5) internal successors, (3380), 40 states have internal predecessors, (3380), 0 states have call successors, (0), 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-30 21:52:32,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:52:32,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 334 [2023-08-30 21:52:32,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:52:34,933 INFO L130 PetriNetUnfolder]: 763/1524 cut-off events. [2023-08-30 21:52:34,933 INFO L131 PetriNetUnfolder]: For 35003/35003 co-relation queries the response was YES. [2023-08-30 21:52:34,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16190 conditions, 1524 events. 763/1524 cut-off events. For 35003/35003 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8518 event pairs, 75 based on Foata normal form. 9/1533 useless extension candidates. Maximal degree in co-relation 16126. Up to 527 conditions per place. [2023-08-30 21:52:34,944 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 83 selfloop transitions, 249 changer transitions 18/350 dead transitions. [2023-08-30 21:52:34,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 350 transitions, 8365 flow [2023-08-30 21:52:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 21:52:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 21:52:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3042 transitions. [2023-08-30 21:52:34,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2602224123182207 [2023-08-30 21:52:34,948 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3042 transitions. [2023-08-30 21:52:34,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3042 transitions. [2023-08-30 21:52:34,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:52:34,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3042 transitions. [2023-08-30 21:52:34,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 86.91428571428571) internal successors, (3042), 35 states have internal predecessors, (3042), 0 states have call successors, (0), 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-30 21:52:34,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 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-30 21:52:34,959 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 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-30 21:52:34,959 INFO L175 Difference]: Start difference. First operand has 241 places, 236 transitions, 5752 flow. Second operand 35 states and 3042 transitions. [2023-08-30 21:52:34,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 350 transitions, 8365 flow [2023-08-30 21:52:35,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 350 transitions, 7267 flow, removed 79 selfloop flow, removed 33 redundant places. [2023-08-30 21:52:35,084 INFO L231 Difference]: Finished difference. Result has 202 places, 286 transitions, 6735 flow [2023-08-30 21:52:35,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=4932, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=6735, PETRI_PLACES=202, PETRI_TRANSITIONS=286} [2023-08-30 21:52:35,084 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 180 predicate places. [2023-08-30 21:52:35,084 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 286 transitions, 6735 flow [2023-08-30 21:52:35,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 84.5) internal successors, (3380), 40 states have internal predecessors, (3380), 0 states have call successors, (0), 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-30 21:52:35,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:52:35,085 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:52:35,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-30 21:52:35,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:52:35,286 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:52:35,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:52:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -346401776, now seen corresponding path program 20 times [2023-08-30 21:52:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:52:35,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238375062] [2023-08-30 21:52:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:52:35,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:52:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:52:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:52:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:52:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238375062] [2023-08-30 21:52:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238375062] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:52:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59551672] [2023-08-30 21:52:37,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 21:52:37,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:52:37,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:52:37,630 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:52:37,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 21:52:37,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 21:52:37,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:52:37,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-30 21:52:37,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:52:37,763 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-08-30 21:52:37,763 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 2 case distinctions, treesize of input 12 treesize of output 16 [2023-08-30 21:52:37,920 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:52:37,920 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-30 21:52:38,078 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 29 treesize of output 29 [2023-08-30 21:52:38,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:38,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 40 [2023-08-30 21:52:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 21:52:38,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:52:38,655 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (* c_~q1_back~0 4)) (.cse2 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_940 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_940))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= (select .cse0 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (+ (select .cse0 (+ .cse2 ~q1~0.offset)) 1) c_~N~0)))) (< (select (select .cse3 c_~q2~0.base) .cse4) c_~N~0)))) (forall ((v_ArrVal_940 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_940))) (or (< (+ (select (select .cse5 c_~q2~0.base) .cse4) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (not (= (select .cse6 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (select .cse6 (+ .cse2 ~q1~0.offset)) c_~N~0))))))))) is different from false [2023-08-30 21:52:38,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:38,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-08-30 21:52:38,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:38,792 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 143 treesize of output 166 [2023-08-30 21:52:38,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:52:38,820 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 125 treesize of output 148 [2023-08-30 21:53:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-30 21:53:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59551672] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:53:24,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:53:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 10] total 39 [2023-08-30 21:53:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647882619] [2023-08-30 21:53:24,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:53:24,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-30 21:53:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:53:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-30 21:53:24,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1431, Unknown=1, NotChecked=76, Total=1640 [2023-08-30 21:53:24,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-08-30 21:53:24,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 286 transitions, 6735 flow. Second operand has 41 states, 41 states have (on average 80.48780487804878) internal successors, (3300), 41 states have internal predecessors, (3300), 0 states have call successors, (0), 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-30 21:53:24,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:53:24,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-08-30 21:53:24,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:53:27,352 INFO L130 PetriNetUnfolder]: 737/1476 cut-off events. [2023-08-30 21:53:27,352 INFO L131 PetriNetUnfolder]: For 26609/26609 co-relation queries the response was YES. [2023-08-30 21:53:27,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14906 conditions, 1476 events. 737/1476 cut-off events. For 26609/26609 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8207 event pairs, 73 based on Foata normal form. 1/1477 useless extension candidates. Maximal degree in co-relation 14855. Up to 529 conditions per place. [2023-08-30 21:53:27,362 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 74 selfloop transitions, 255 changer transitions 11/340 dead transitions. [2023-08-30 21:53:27,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 340 transitions, 7914 flow [2023-08-30 21:53:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 21:53:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 21:53:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2889 transitions. [2023-08-30 21:53:27,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2471343028229256 [2023-08-30 21:53:27,365 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2889 transitions. [2023-08-30 21:53:27,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2889 transitions. [2023-08-30 21:53:27,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:53:27,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2889 transitions. [2023-08-30 21:53:27,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 82.54285714285714) internal successors, (2889), 35 states have internal predecessors, (2889), 0 states have call successors, (0), 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-30 21:53:27,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 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-30 21:53:27,374 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 334.0) internal successors, (12024), 36 states have internal predecessors, (12024), 0 states have call successors, (0), 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-30 21:53:27,374 INFO L175 Difference]: Start difference. First operand has 202 places, 286 transitions, 6735 flow. Second operand 35 states and 2889 transitions. [2023-08-30 21:53:27,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 340 transitions, 7914 flow [2023-08-30 21:53:27,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 340 transitions, 7759 flow, removed 37 selfloop flow, removed 8 redundant places. [2023-08-30 21:53:27,463 INFO L231 Difference]: Finished difference. Result has 232 places, 296 transitions, 7559 flow [2023-08-30 21:53:27,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=6596, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=7559, PETRI_PLACES=232, PETRI_TRANSITIONS=296} [2023-08-30 21:53:27,464 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 210 predicate places. [2023-08-30 21:53:27,464 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 296 transitions, 7559 flow [2023-08-30 21:53:27,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 80.48780487804878) internal successors, (3300), 41 states have internal predecessors, (3300), 0 states have call successors, (0), 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-30 21:53:27,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:53:27,465 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:53:27,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 21:53:27,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:53:27,670 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 21:53:27,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:53:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1598784857, now seen corresponding path program 21 times [2023-08-30 21:53:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:53:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95268428] [2023-08-30 21:53:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:53:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:53:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:53:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:53:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:53:29,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95268428] [2023-08-30 21:53:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95268428] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:53:29,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186400031] [2023-08-30 21:53:29,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 21:53:29,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:53:29,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:53:29,212 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:53:29,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 21:53:29,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 21:53:29,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:53:29,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 70 conjunts are in the unsatisfiable core [2023-08-30 21:53:29,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:53:29,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 21:53:29,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:53:29,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:53:30,273 INFO L321 Elim1Store]: treesize reduction 70, result has 27.8 percent of original size [2023-08-30 21:53:30,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 43 [2023-08-30 21:53:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:53:30,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:53:33,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:53:33,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 141 [2023-08-30 21:53:33,891 INFO L321 Elim1Store]: treesize reduction 9, result has 90.3 percent of original size [2023-08-30 21:53:33,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2013 treesize of output 1792 [2023-08-30 21:53:33,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:53:34,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:53:34,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 840 treesize of output 672 [2023-08-30 21:53:34,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:53:34,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:53:34,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 592 treesize of output 544 [2023-08-30 21:53:54,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:53:54,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 141 [2023-08-30 21:53:54,237 INFO L321 Elim1Store]: treesize reduction 51, result has 45.2 percent of original size [2023-08-30 21:53:54,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1037 treesize of output 918 [2023-08-30 21:53:54,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:53:54,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:53:54,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:53:54,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 867 treesize of output 639 [2023-08-30 21:53:54,367 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:53:54,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:53:54,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:53:54,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 582 treesize of output 483 [2023-08-30 21:53:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:53:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186400031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:53:55,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:53:55,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2023-08-30 21:53:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848555482] [2023-08-30 21:53:55,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:53:55,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-30 21:53:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:53:55,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-30 21:53:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2558, Unknown=2, NotChecked=0, Total=2862 [2023-08-30 21:54:03,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-08-30 21:54:03,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 296 transitions, 7559 flow. Second operand has 54 states, 54 states have (on average 79.24074074074075) internal successors, (4279), 54 states have internal predecessors, (4279), 0 states have call successors, (0), 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-30 21:54:03,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:54:03,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-08-30 21:54:03,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:54:22,996 WARN L222 SmtUtils]: Spent 16.40s on a formula simplification. DAG size of input: 148 DAG size of output: 147 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:54:40,372 WARN L222 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 148 DAG size of output: 147 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:54:52,607 WARN L222 SmtUtils]: Spent 11.03s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:55:01,980 WARN L222 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:55:15,186 WARN L222 SmtUtils]: Spent 11.55s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:55:26,428 WARN L222 SmtUtils]: Spent 10.64s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 21:55:28,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 21:55:31,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15