./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:27:57,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:27:57,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:27:57,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:27:57,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:27:57,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:27:57,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:27:57,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:27:57,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:27:57,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:27:57,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:27:57,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:27:57,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:27:57,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:27:57,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:27:57,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:27:57,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:27:57,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:27:57,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:27:57,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:27:57,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:27:57,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:27:57,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:27:57,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:27:57,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:27:57,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:27:57,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:27:57,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:27:57,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:27:57,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:27:57,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:27:57,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:27:57,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:27:57,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:27:57,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:27:57,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:27:57,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:27:57,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:27:57,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:27:57,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:27:57,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:27:57,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 13:27:57,841 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:27:57,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:27:57,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:27:57,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:27:57,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:27:57,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:27:57,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:27:57,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:27:57,844 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:27:57,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:27:57,845 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:27:57,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 13:27:57,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:27:57,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:27:57,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:27:57,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:27:57,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:27:57,847 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:27:57,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:27:57,847 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:27:57,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:27:57,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:27:57,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:27:57,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:27:57,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:27:57,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:27:57,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:27:57,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:27:57,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 13:27:57,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 13:27:57,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:27:57,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:27:57,851 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:27:57,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:27:57,851 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:27:57,851 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 13:27:58,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:27:58,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:27:58,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:27:58,198 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:27:58,199 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:27:58,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-09-01 13:27:59,316 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:27:59,517 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:27:59,517 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-09-01 13:27:59,522 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c72de0f3/68b643ed0452449d972ec01e71dd7457/FLAG1bc3edfad [2023-09-01 13:27:59,535 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c72de0f3/68b643ed0452449d972ec01e71dd7457 [2023-09-01 13:27:59,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:27:59,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:27:59,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:27:59,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:27:59,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:27:59,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59, skipping insertion in model container [2023-09-01 13:27:59,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:27:59,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:27:59,738 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-09-01 13:27:59,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:27:59,766 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:27:59,806 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-09-01 13:27:59,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:27:59,818 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:27:59,819 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:27:59,825 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:27:59,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59 WrapperNode [2023-09-01 13:27:59,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:27:59,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:27:59,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:27:59,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:27:59,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,880 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-09-01 13:27:59,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:27:59,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:27:59,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:27:59,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:27:59,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,918 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:27:59,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:27:59,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:27:59,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:27:59,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (1/1) ... [2023-09-01 13:27:59,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:27:59,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:27:59,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 13:27:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 13:27:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:28:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:28:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 13:28:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 13:28:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:28:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:28:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:28:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:28:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 13:28:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 13:28:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 13:28:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 13:28:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 13:28:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:28:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:28:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:28:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:28:00,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:28:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:28:00,021 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:28:00,179 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:28:00,181 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:28:00,510 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:28:00,597 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:28:00,597 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 13:28:00,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:28:00 BoogieIcfgContainer [2023-09-01 13:28:00,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:28:00,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:28:00,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:28:00,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:28:00,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:27:59" (1/3) ... [2023-09-01 13:28:00,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:28:00, skipping insertion in model container [2023-09-01 13:28:00,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:27:59" (2/3) ... [2023-09-01 13:28:00,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:28:00, skipping insertion in model container [2023-09-01 13:28:00,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:28:00" (3/3) ... [2023-09-01 13:28:00,614 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-09-01 13:28:00,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:28:00,630 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:28:00,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:28:00,631 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:28:00,704 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 13:28:00,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 356 flow [2023-09-01 13:28:00,797 INFO L130 PetriNetUnfolder]: 12/158 cut-off events. [2023-09-01 13:28:00,797 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 13:28:00,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 158 events. 12/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-09-01 13:28:00,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 356 flow [2023-09-01 13:28:00,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 316 flow [2023-09-01 13:28:00,810 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:28:00,818 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 146 transitions, 316 flow [2023-09-01 13:28:00,821 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 316 flow [2023-09-01 13:28:00,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 316 flow [2023-09-01 13:28:00,863 INFO L130 PetriNetUnfolder]: 12/146 cut-off events. [2023-09-01 13:28:00,864 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 13:28:00,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 12/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-09-01 13:28:00,870 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2023-09-01 13:28:05,580 INFO L134 LiptonReduction]: Checked pairs total: 3482 [2023-09-01 13:28:05,580 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-09-01 13:28:05,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 13:28:05,596 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;@5ce86977, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 13:28:05,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 13:28:05,609 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2023-09-01 13:28:05,609 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 13:28:05,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:05,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:05,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:05,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1385427649, now seen corresponding path program 1 times [2023-09-01 13:28:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199974472] [2023-09-01 13:28:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:28:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:05,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199974472] [2023-09-01 13:28:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199974472] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:28:05,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:28:05,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:28:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779115648] [2023-09-01 13:28:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:28:05,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:28:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:28:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:28:06,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-09-01 13:28:06,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:06,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-09-01 13:28:06,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:06,325 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2023-09-01 13:28:06,326 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-09-01 13:28:06,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7098 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2023-09-01 13:28:06,337 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-09-01 13:28:06,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-09-01 13:28:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:28:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:28:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-09-01 13:28:06,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2023-09-01 13:28:06,351 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-09-01 13:28:06,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-09-01 13:28:06,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:06,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-09-01 13:28:06,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,365 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,367 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 586 transitions. [2023-09-01 13:28:06,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-09-01 13:28:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 13:28:06,374 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-09-01 13:28:06,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-09-01 13:28:06,379 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-09-01 13:28:06,379 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-09-01 13:28:06,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:06,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:06,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 13:28:06,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:06,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1622835390, now seen corresponding path program 1 times [2023-09-01 13:28:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690736772] [2023-09-01 13:28:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:28:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690736772] [2023-09-01 13:28:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690736772] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:28:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:28:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:28:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535075276] [2023-09-01 13:28:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:28:06,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:28:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:28:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:28:06,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-09-01 13:28:06,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:06,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-09-01 13:28:06,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:06,768 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2023-09-01 13:28:06,769 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2023-09-01 13:28:06,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8125 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2023-09-01 13:28:06,780 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-09-01 13:28:06,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-09-01 13:28:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:28:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:28:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2023-09-01 13:28:06,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49746621621621623 [2023-09-01 13:28:06,783 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 589 transitions. [2023-09-01 13:28:06,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions. [2023-09-01 13:28:06,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:06,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions. [2023-09-01 13:28:06,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,788 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,788 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 589 transitions. [2023-09-01 13:28:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-09-01 13:28:06,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 13:28:06,790 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-09-01 13:28:06,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-09-01 13:28:06,791 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-09-01 13:28:06,792 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-09-01 13:28:06,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:06,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:06,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 13:28:06,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:06,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805984, now seen corresponding path program 1 times [2023-09-01 13:28:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573577072] [2023-09-01 13:28:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:28:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:06,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573577072] [2023-09-01 13:28:06,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573577072] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:28:06,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:28:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:28:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305705378] [2023-09-01 13:28:06,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:28:06,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:28:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:06,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:28:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:28:06,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-09-01 13:28:06,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:06,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:06,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-09-01 13:28:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:07,208 INFO L130 PetriNetUnfolder]: 1632/2232 cut-off events. [2023-09-01 13:28:07,209 INFO L131 PetriNetUnfolder]: For 545/694 co-relation queries the response was YES. [2023-09-01 13:28:07,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 2232 events. 1632/2232 cut-off events. For 545/694 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8389 event pairs, 977 based on Foata normal form. 149/1982 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-09-01 13:28:07,222 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-09-01 13:28:07,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-09-01 13:28:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:28:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:28:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-09-01 13:28:07,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2023-09-01 13:28:07,225 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-09-01 13:28:07,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-09-01 13:28:07,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:07,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-09-01 13:28:07,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,230 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,230 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 586 transitions. [2023-09-01 13:28:07,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-09-01 13:28:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 13:28:07,234 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-09-01 13:28:07,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-09-01 13:28:07,236 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-09-01 13:28:07,238 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-09-01 13:28:07,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:07,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:07,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 13:28:07,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:07,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1347991008, now seen corresponding path program 1 times [2023-09-01 13:28:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463154688] [2023-09-01 13:28:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:28:07,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:07,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463154688] [2023-09-01 13:28:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463154688] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:28:07,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:28:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:28:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188540512] [2023-09-01 13:28:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:28:07,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:28:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:28:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:28:07,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 296 [2023-09-01 13:28:07,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:07,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 296 [2023-09-01 13:28:07,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:07,662 INFO L130 PetriNetUnfolder]: 1632/2233 cut-off events. [2023-09-01 13:28:07,662 INFO L131 PetriNetUnfolder]: For 878/1027 co-relation queries the response was YES. [2023-09-01 13:28:07,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2233 events. 1632/2233 cut-off events. For 878/1027 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 1243 based on Foata normal form. 149/1978 useless extension candidates. Maximal degree in co-relation 1883. Up to 2223 conditions per place. [2023-09-01 13:28:07,673 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-09-01 13:28:07,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-09-01 13:28:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:28:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:28:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-09-01 13:28:07,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48873873873873874 [2023-09-01 13:28:07,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-09-01 13:28:07,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-09-01 13:28:07,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:07,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-09-01 13:28:07,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,683 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 434 transitions. [2023-09-01 13:28:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-09-01 13:28:07,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 13:28:07,687 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-09-01 13:28:07,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-09-01 13:28:07,689 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-09-01 13:28:07,689 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-09-01 13:28:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:07,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:07,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:07,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 13:28:07,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:07,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:07,691 INFO L85 PathProgramCache]: Analyzing trace with hash -406219004, now seen corresponding path program 1 times [2023-09-01 13:28:07,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:07,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627290044] [2023-09-01 13:28:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:07,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:28:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627290044] [2023-09-01 13:28:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627290044] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:28:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762779745] [2023-09-01 13:28:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:08,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:28:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:28:08,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:28:08,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 13:28:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:08,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2023-09-01 13:28:08,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:28:08,816 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-09-01 13:28:08,882 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-09-01 13:28:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:28:08,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:28:09,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:28:09,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:28:09,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-01 13:28:09,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-09-01 13:28:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:28:09,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:28:09,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-09-01 13:28:09,392 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) is different from false [2023-09-01 13:28:09,673 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~min~0)))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 2 .cse3)) (< 2147483646 .cse3))))))))) is different from false [2023-09-01 13:28:09,720 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse1 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 (+ 2 .cse2)) (< 2147483646 .cse2)))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse0) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 2 .cse5)) (< 2147483646 .cse5))))))))) is different from false [2023-09-01 13:28:09,812 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ .cse1 2)) (< 2147483646 .cse1)))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse5) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse5 (+ .cse6 2)) (< 2147483646 .cse6))))))))) is different from false [2023-09-01 13:28:09,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:28:09,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 77 [2023-09-01 13:28:09,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2845 treesize of output 2653 [2023-09-01 13:28:09,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2023-09-01 13:28:09,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 120 [2023-09-01 13:28:09,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2023-09-01 13:28:10,031 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-01 13:28:10,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2023-09-01 13:28:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-09-01 13:28:10,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762779745] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:28:10,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:28:10,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2023-09-01 13:28:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055905062] [2023-09-01 13:28:10,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:28:10,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 13:28:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:10,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 13:28:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=7, NotChecked=204, Total=870 [2023-09-01 13:28:10,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 296 [2023-09-01 13:28:10,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:10,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:10,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 296 [2023-09-01 13:28:10,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:14,104 INFO L130 PetriNetUnfolder]: 12624/17356 cut-off events. [2023-09-01 13:28:14,104 INFO L131 PetriNetUnfolder]: For 4404/5446 co-relation queries the response was YES. [2023-09-01 13:28:14,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44463 conditions, 17356 events. 12624/17356 cut-off events. For 4404/5446 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 93108 event pairs, 1024 based on Foata normal form. 1052/14660 useless extension candidates. Maximal degree in co-relation 44449. Up to 4507 conditions per place. [2023-09-01 13:28:14,186 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 240 selfloop transitions, 47 changer transitions 267/555 dead transitions. [2023-09-01 13:28:14,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 555 transitions, 2750 flow [2023-09-01 13:28:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-09-01 13:28:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-09-01 13:28:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3633 transitions. [2023-09-01 13:28:14,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37192874692874694 [2023-09-01 13:28:14,197 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3633 transitions. [2023-09-01 13:28:14,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3633 transitions. [2023-09-01 13:28:14,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:14,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3633 transitions. [2023-09-01 13:28:14,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 110.0909090909091) internal successors, (3633), 33 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:14,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:14,224 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:14,224 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 33 states and 3633 transitions. [2023-09-01 13:28:14,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 555 transitions, 2750 flow [2023-09-01 13:28:14,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 555 transitions, 2746 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 13:28:14,309 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 498 flow [2023-09-01 13:28:14,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=498, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2023-09-01 13:28:14,309 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-09-01 13:28:14,310 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 498 flow [2023-09-01 13:28:14,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:14,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:14,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:14,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-09-01 13:28:14,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:28:14,512 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:14,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash -776649670, now seen corresponding path program 2 times [2023-09-01 13:28:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864375235] [2023-09-01 13:28:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:28:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:14,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864375235] [2023-09-01 13:28:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864375235] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:28:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:28:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:28:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218678536] [2023-09-01 13:28:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:28:14,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:28:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:14,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:28:14,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:28:14,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2023-09-01 13:28:14,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:14,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:14,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2023-09-01 13:28:14,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:16,338 INFO L130 PetriNetUnfolder]: 9630/13442 cut-off events. [2023-09-01 13:28:16,338 INFO L131 PetriNetUnfolder]: For 68558/70152 co-relation queries the response was YES. [2023-09-01 13:28:16,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52345 conditions, 13442 events. 9630/13442 cut-off events. For 68558/70152 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 72658 event pairs, 864 based on Foata normal form. 1595/14187 useless extension candidates. Maximal degree in co-relation 52298. Up to 7235 conditions per place. [2023-09-01 13:28:16,427 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 93 selfloop transitions, 2 changer transitions 160/256 dead transitions. [2023-09-01 13:28:16,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 256 transitions, 2064 flow [2023-09-01 13:28:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:28:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:28:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2023-09-01 13:28:16,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2023-09-01 13:28:16,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2023-09-01 13:28:16,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2023-09-01 13:28:16,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:16,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2023-09-01 13:28:16,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:16,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:16,436 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:16,436 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 498 flow. Second operand 5 states and 752 transitions. [2023-09-01 13:28:16,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 256 transitions, 2064 flow [2023-09-01 13:28:16,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 256 transitions, 1985 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-09-01 13:28:16,617 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 301 flow [2023-09-01 13:28:16,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-09-01 13:28:16,618 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-09-01 13:28:16,618 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 301 flow [2023-09-01 13:28:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:16,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:16,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:16,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 13:28:16,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:16,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash -421841092, now seen corresponding path program 3 times [2023-09-01 13:28:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195217368] [2023-09-01 13:28:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:28:17,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:17,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195217368] [2023-09-01 13:28:17,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195217368] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:28:17,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923044944] [2023-09-01 13:28:17,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:28:17,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:28:17,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:28:17,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:28:17,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 13:28:17,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-01 13:28:17,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:28:17,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-09-01 13:28:17,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:28:17,470 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-09-01 13:28:17,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:28:17,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:28:17,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-01 13:28:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:28:17,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:28:18,038 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2023-09-01 13:28:24,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:28:24,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-09-01 13:28:24,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-09-01 13:28:24,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-09-01 13:28:24,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-09-01 13:28:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-09-01 13:28:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923044944] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:28:24,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:28:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 26 [2023-09-01 13:28:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670862817] [2023-09-01 13:28:24,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:28:24,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-01 13:28:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:24,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-01 13:28:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=554, Unknown=15, NotChecked=50, Total=756 [2023-09-01 13:28:24,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 296 [2023-09-01 13:28:24,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 301 flow. Second operand has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:24,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:24,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 296 [2023-09-01 13:28:24,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:32,295 INFO L130 PetriNetUnfolder]: 24993/34453 cut-off events. [2023-09-01 13:28:32,295 INFO L131 PetriNetUnfolder]: For 192048/192048 co-relation queries the response was YES. [2023-09-01 13:28:32,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136650 conditions, 34453 events. 24993/34453 cut-off events. For 192048/192048 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 198980 event pairs, 1319 based on Foata normal form. 20/31888 useless extension candidates. Maximal degree in co-relation 136616. Up to 7291 conditions per place. [2023-09-01 13:28:32,515 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 388 selfloop transitions, 177 changer transitions 760/1325 dead transitions. [2023-09-01 13:28:32,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1325 transitions, 9162 flow [2023-09-01 13:28:32,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-09-01 13:28:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-09-01 13:28:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 9798 transitions. [2023-09-01 13:28:32,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.380475302889096 [2023-09-01 13:28:32,543 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 9798 transitions. [2023-09-01 13:28:32,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 9798 transitions. [2023-09-01 13:28:32,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:28:32,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 9798 transitions. [2023-09-01 13:28:32,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 112.62068965517241) internal successors, (9798), 87 states have internal predecessors, (9798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:32,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:32,624 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:32,624 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 301 flow. Second operand 87 states and 9798 transitions. [2023-09-01 13:28:32,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1325 transitions, 9162 flow [2023-09-01 13:28:33,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1325 transitions, 8285 flow, removed 408 selfloop flow, removed 10 redundant places. [2023-09-01 13:28:33,725 INFO L231 Difference]: Finished difference. Result has 211 places, 233 transitions, 2150 flow [2023-09-01 13:28:33,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=2150, PETRI_PLACES=211, PETRI_TRANSITIONS=233} [2023-09-01 13:28:33,726 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2023-09-01 13:28:33,726 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 233 transitions, 2150 flow [2023-09-01 13:28:33,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:33,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:28:33,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:28:33,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 13:28:33,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-09-01 13:28:33,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:28:33,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:28:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash -551404586, now seen corresponding path program 4 times [2023-09-01 13:28:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:28:33,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576661742] [2023-09-01 13:28:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:28:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:28:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:28:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:28:35,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:28:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576661742] [2023-09-01 13:28:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576661742] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:28:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181609167] [2023-09-01 13:28:35,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 13:28:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:28:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:28:35,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:28:35,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 13:28:35,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 13:28:35,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:28:35,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-09-01 13:28:35,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:28:35,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 862 [2023-09-01 13:28:35,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:28:35,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:28:35,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-09-01 13:28:35,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-09-01 13:28:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:28:35,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:28:35,581 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_354) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse0 1)) (< 2147483647 .cse0)))) is different from false [2023-09-01 13:28:36,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2023-09-01 13:28:36,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-09-01 13:28:36,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-09-01 13:28:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:28:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181609167] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:28:36,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:28:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2023-09-01 13:28:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128850877] [2023-09-01 13:28:36,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:28:36,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 13:28:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:28:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 13:28:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=751, Unknown=15, NotChecked=58, Total=992 [2023-09-01 13:28:36,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 296 [2023-09-01 13:28:36,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 233 transitions, 2150 flow. Second operand has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:28:36,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:28:36,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 296 [2023-09-01 13:28:36,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:28:45,685 WARN L222 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 51 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:29:14,632 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 66 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:29:38,171 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 69 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:29:46,489 WARN L222 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 58 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:30:52,324 INFO L130 PetriNetUnfolder]: 46739/65136 cut-off events. [2023-09-01 13:30:52,325 INFO L131 PetriNetUnfolder]: For 4917524/4917524 co-relation queries the response was YES. [2023-09-01 13:30:53,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624230 conditions, 65136 events. 46739/65136 cut-off events. For 4917524/4917524 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 418056 event pairs, 1838 based on Foata normal form. 35/65170 useless extension candidates. Maximal degree in co-relation 624132. Up to 17165 conditions per place. [2023-09-01 13:30:53,586 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 532 selfloop transitions, 475 changer transitions 1128/2135 dead transitions. [2023-09-01 13:30:53,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 2135 transitions, 32125 flow [2023-09-01 13:30:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-09-01 13:30:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2023-09-01 13:30:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 13204 transitions. [2023-09-01 13:30:53,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3512449457331347 [2023-09-01 13:30:53,617 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 13204 transitions. [2023-09-01 13:30:53,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 13204 transitions. [2023-09-01 13:30:53,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:30:53,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 13204 transitions. [2023-09-01 13:30:53,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 103.96850393700787) internal successors, (13204), 127 states have internal predecessors, (13204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:30:53,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:30:53,704 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:30:53,705 INFO L175 Difference]: Start difference. First operand has 211 places, 233 transitions, 2150 flow. Second operand 127 states and 13204 transitions. [2023-09-01 13:30:53,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 2135 transitions, 32125 flow [2023-09-01 13:31:28,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 2135 transitions, 21452 flow, removed 5210 selfloop flow, removed 44 redundant places. [2023-09-01 13:31:28,980 INFO L231 Difference]: Finished difference. Result has 350 places, 549 transitions, 7180 flow [2023-09-01 13:31:28,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=7180, PETRI_PLACES=350, PETRI_TRANSITIONS=549} [2023-09-01 13:31:28,981 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 310 predicate places. [2023-09-01 13:31:28,981 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 549 transitions, 7180 flow [2023-09-01 13:31:28,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:28,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:28,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:31:28,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 13:31:29,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:31:29,183 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:31:29,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash -870441776, now seen corresponding path program 5 times [2023-09-01 13:31:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090891777] [2023-09-01 13:31:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:31:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090891777] [2023-09-01 13:31:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090891777] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:31:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:31:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:31:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202754255] [2023-09-01 13:31:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:31:29,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:31:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:31:29,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:31:29,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2023-09-01 13:31:29,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 549 transitions, 7180 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:29,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:29,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2023-09-01 13:31:29,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:31:43,956 INFO L130 PetriNetUnfolder]: 37002/52700 cut-off events. [2023-09-01 13:31:43,957 INFO L131 PetriNetUnfolder]: For 8252937/8255557 co-relation queries the response was YES. [2023-09-01 13:31:45,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623234 conditions, 52700 events. 37002/52700 cut-off events. For 8252937/8255557 co-relation queries the response was YES. Maximal size of possible extension queue 2089. Compared 345182 event pairs, 10268 based on Foata normal form. 2061/54591 useless extension candidates. Maximal degree in co-relation 623066. Up to 40097 conditions per place. [2023-09-01 13:31:45,715 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 504 selfloop transitions, 38 changer transitions 410/990 dead transitions. [2023-09-01 13:31:45,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 990 transitions, 15337 flow [2023-09-01 13:31:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:31:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:31:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-09-01 13:31:45,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504054054054054 [2023-09-01 13:31:45,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-09-01 13:31:45,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-09-01 13:31:45,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:31:45,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-09-01 13:31:45,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:45,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:45,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:45,720 INFO L175 Difference]: Start difference. First operand has 350 places, 549 transitions, 7180 flow. Second operand 5 states and 746 transitions. [2023-09-01 13:31:45,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 990 transitions, 15337 flow [2023-09-01 13:32:26,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 990 transitions, 14132 flow, removed 568 selfloop flow, removed 76 redundant places. [2023-09-01 13:32:26,914 INFO L231 Difference]: Finished difference. Result has 200 places, 521 transitions, 6411 flow [2023-09-01 13:32:26,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6647, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6411, PETRI_PLACES=200, PETRI_TRANSITIONS=521} [2023-09-01 13:32:26,915 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2023-09-01 13:32:26,915 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 521 transitions, 6411 flow [2023-09-01 13:32:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:32:26,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:32:26,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:32:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 13:32:26,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:32:26,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:32:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -964212870, now seen corresponding path program 6 times [2023-09-01 13:32:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:32:26,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368629472] [2023-09-01 13:32:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:32:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:32:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:32:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:32:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:32:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368629472] [2023-09-01 13:32:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368629472] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:32:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282574143] [2023-09-01 13:32:27,352 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 13:32:27,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:32:27,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:32:27,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:32:27,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 13:32:27,715 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-09-01 13:32:27,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:32:27,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2023-09-01 13:32:27,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:32:27,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:32:27,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:32:27,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:32:27,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:32:27,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:32:27,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-01 13:32:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-09-01 13:32:28,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:28,195 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 49 treesize of output 35 [2023-09-01 13:32:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:32:28,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:32:46,562 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse1 (select .cse0 c_~A~0.offset))) (or (forall ((v_ArrVal_456 Int) (thread1Thread1of1ForFork1_~i~0 Int)) (or (<= (select (store .cse0 c_~A~0.offset v_ArrVal_456) (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) c_~min~0) (< .cse1 (+ v_ArrVal_456 1)))) (< 2147483646 .cse1) (< c_~min~0 (+ .cse1 2)))))) (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base))) (let ((.cse3 (select .cse4 c_~A~0.offset))) (or (forall ((v_ArrVal_456 Int) (thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse2 (select (store .cse4 c_~A~0.offset v_ArrVal_456) (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< c_~min~0 .cse2) (< .cse2 (+ .cse3 2)) (< .cse3 (+ v_ArrVal_456 1))))) (< 2147483646 .cse3)))))) is different from false [2023-09-01 13:32:46,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1799 treesize of output 1769 [2023-09-01 13:32:46,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,714 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 1207 treesize of output 1136 [2023-09-01 13:32:46,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,758 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 1167 treesize of output 1159 [2023-09-01 13:32:46,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,794 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 1155 treesize of output 1144 [2023-09-01 13:32:46,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,836 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 1183 treesize of output 1152 [2023-09-01 13:32:46,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,881 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 1183 treesize of output 1144 [2023-09-01 13:32:46,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,930 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 1155 treesize of output 1140 [2023-09-01 13:32:46,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:32:46,977 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 1141 treesize of output 1138 [2023-09-01 13:32:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:32:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282574143] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 13:32:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 13:32:55,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8, 13] total 32 [2023-09-01 13:32:55,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143311753] [2023-09-01 13:32:55,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:32:55,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 13:32:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:32:55,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 13:32:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=876, Unknown=14, NotChecked=62, Total=1122 [2023-09-01 13:32:55,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 296 [2023-09-01 13:32:55,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 521 transitions, 6411 flow. Second operand has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:32:55,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:32:55,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 296 [2023-09-01 13:32:55,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:33:00,496 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-09-01 13:33:02,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:33:04,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:33:06,672 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-09-01 13:33:08,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:33:22,511 WARN L222 SmtUtils]: Spent 13.01s on a formula simplification. DAG size of input: 127 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:33:24,585 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-09-01 13:33:26,817 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-09-01 13:33:28,844 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-09-01 13:34:32,487 WARN L222 SmtUtils]: Spent 58.40s on a formula simplification. DAG size of input: 182 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:35:15,138 WARN L222 SmtUtils]: Spent 39.33s on a formula simplification. DAG size of input: 160 DAG size of output: 107 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:35:17,473 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-09-01 13:35:19,489 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-09-01 13:35:21,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:23,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:37,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:39,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:41,333 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-09-01 13:35:49,672 WARN L222 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 102 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:35:51,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:53,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:55,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:35:57,783 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-09-01 13:35:59,804 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-09-01 13:36:36,378 WARN L222 SmtUtils]: Spent 34.01s on a formula simplification. DAG size of input: 94 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:36:38,389 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-09-01 13:36:41,417 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-09-01 13:36:43,911 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-09-01 13:36:46,234 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-09-01 13:36:48,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:36:50,288 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-09-01 13:36:52,335 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-09-01 13:36:54,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:36:56,708 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-09-01 13:36:58,713 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-09-01 13:37:33,140 WARN L222 SmtUtils]: Spent 26.05s on a formula simplification. DAG size of input: 105 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:37:35,526 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-09-01 13:37:37,544 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-09-01 13:37:39,731 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-09-01 13:37:41,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:37:43,753 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-09-01 13:37:46,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:37:48,234 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-09-01 13:39:07,181 WARN L222 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 127 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:39:09,373 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-09-01 13:39:11,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:13,564 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-09-01 13:39:15,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:17,656 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-09-01 13:39:19,685 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-09-01 13:39:21,756 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-09-01 13:39:27,988 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 93 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:39:30,021 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-09-01 13:39:32,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:34,765 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-09-01 13:39:36,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:38,981 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-09-01 13:39:40,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:44,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:46,913 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-09-01 13:39:48,939 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-09-01 13:39:50,969 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-09-01 13:39:52,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:55,023 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-09-01 13:39:57,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:39:59,092 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-09-01 13:40:01,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:03,379 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-09-01 13:40:05,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:07,438 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-09-01 13:40:09,496 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-09-01 13:40:11,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:14,159 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-09-01 13:40:16,189 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-09-01 13:40:22,645 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-09-01 13:40:24,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:26,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:28,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:30,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:32,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:34,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:37,403 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-09-01 13:40:39,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:41,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:43,442 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-09-01 13:40:47,561 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-09-01 13:40:48,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:52,873 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-09-01 13:40:54,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:56,992 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-09-01 13:40:59,039 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-09-01 13:41:01,057 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-09-01 13:41:03,071 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-09-01 13:41:09,492 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-09-01 13:41:11,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:13,898 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-09-01 13:41:15,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:17,926 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-09-01 13:41:19,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:21,963 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-09-01 13:41:24,043 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-09-01 13:41:26,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:28,820 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-09-01 13:41:30,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:33,032 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-09-01 13:41:35,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:37,523 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-09-01 13:41:39,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:41,609 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-09-01 13:41:43,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:45,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:47,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:49,739 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-09-01 13:41:51,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:54,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:56,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:41:58,255 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-09-01 13:42:00,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15