./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -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 a025fe4ca65874bde9a09e6a2d9fa9eceda581ed1bc5b23e0ff5285795ed115b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 22:52:32,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 22:52:32,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 22:52:32,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 22:52:32,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 22:52:32,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 22:52:32,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 22:52:32,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 22:52:32,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 22:52:32,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 22:52:32,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 22:52:32,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 22:52:32,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 22:52:32,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 22:52:32,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 22:52:32,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 22:52:32,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 22:52:32,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 22:52:32,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 22:52:32,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 22:52:32,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 22:52:32,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 22:52:32,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 22:52:32,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 22:52:32,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 22:52:32,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 22:52:32,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 22:52:32,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 22:52:32,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 22:52:32,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 22:52:32,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 22:52:32,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 22:52:32,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 22:52:32,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 22:52:32,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 22:52:32,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 22:52:32,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 22:52:32,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 22:52:32,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 22:52:32,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 22:52:32,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 22:52:32,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 22:52:32,231 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 22:52:32,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 22:52:32,232 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 22:52:32,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 22:52:32,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 22:52:32,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 22:52:32,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 22:52:32,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 22:52:32,235 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 22:52:32,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 22:52:32,236 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 22:52:32,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 22:52:32,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 22:52:32,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 22:52:32,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 22:52:32,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 22:52:32,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 22:52:32,238 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 22:52:32,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 22:52:32,238 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 22:52:32,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 22:52:32,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 22:52:32,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 22:52:32,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 22:52:32,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 22:52:32,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 22:52:32,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 22:52:32,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 22:52:32,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 22:52:32,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 22:52:32,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 22:52:32,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 22:52:32,241 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 22:52:32,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 22:52:32,241 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 22:52:32,241 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 -> a025fe4ca65874bde9a09e6a2d9fa9eceda581ed1bc5b23e0ff5285795ed115b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 22:52:32,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 22:52:32,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 22:52:32,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 22:52:32,600 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 22:52:32,600 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 22:52:32,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-30 22:52:33,678 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 22:52:33,949 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 22:52:33,957 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-30 22:52:33,967 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0353d60ce/99c445f6b5a443b0bfd0d70377e02dea/FLAG893a7293c [2023-08-30 22:52:33,978 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0353d60ce/99c445f6b5a443b0bfd0d70377e02dea [2023-08-30 22:52:33,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 22:52:33,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 22:52:33,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 22:52:33,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 22:52:33,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 22:52:33,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:52:33" (1/1) ... [2023-08-30 22:52:33,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772625a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:33, skipping insertion in model container [2023-08-30 22:52:33,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:52:33" (1/1) ... [2023-08-30 22:52:33,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 22:52:34,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 22:52:34,246 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-08-30 22:52:34,259 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-08-30 22:52:34,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 22:52:34,282 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 22:52:34,335 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-08-30 22:52:34,341 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-08-30 22:52:34,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 22:52:34,425 INFO L208 MainTranslator]: Completed translation [2023-08-30 22:52:34,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34 WrapperNode [2023-08-30 22:52:34,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 22:52:34,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 22:52:34,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 22:52:34,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 22:52:34,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,484 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2023-08-30 22:52:34,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 22:52:34,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 22:52:34,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 22:52:34,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 22:52:34,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,529 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 22:52:34,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 22:52:34,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 22:52:34,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 22:52:34,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (1/1) ... [2023-08-30 22:52:34,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 22:52:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:52:34,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 22:52:34,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 22:52:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 22:52:34,620 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 22:52:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 22:52:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 22:52:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 22:52:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 22:52:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 22:52:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 22:52:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 22:52:34,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 22:52:34,626 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 22:52:34,764 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 22:52:34,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 22:52:35,103 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 22:52:35,256 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 22:52:35,256 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 22:52:35,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:52:35 BoogieIcfgContainer [2023-08-30 22:52:35,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 22:52:35,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 22:52:35,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 22:52:35,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 22:52:35,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 10:52:33" (1/3) ... [2023-08-30 22:52:35,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0187c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:52:35, skipping insertion in model container [2023-08-30 22:52:35,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:52:34" (2/3) ... [2023-08-30 22:52:35,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0187c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:52:35, skipping insertion in model container [2023-08-30 22:52:35,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:52:35" (3/3) ... [2023-08-30 22:52:35,264 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-08-30 22:52:35,274 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 22:52:35,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 22:52:35,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 22:52:35,296 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 22:52:35,383 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 22:52:35,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 22:52:35,479 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-08-30 22:52:35,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 22:52:35,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-30 22:52:35,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 22:52:35,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-30 22:52:35,495 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 22:52:35,504 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-30 22:52:35,506 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-30 22:52:35,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 22:52:35,528 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-08-30 22:52:35,528 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 22:52:35,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-30 22:52:35,531 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-30 22:52:38,393 INFO L134 LiptonReduction]: Checked pairs total: 2354 [2023-08-30 22:52:38,393 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-30 22:52:38,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 22:52:38,411 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;@2dd27692, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 22:52:38,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 22:52:38,416 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-08-30 22:52:38,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 22:52:38,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:38,417 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 22:52:38,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 22:52:38,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 147020590, now seen corresponding path program 1 times [2023-08-30 22:52:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439662555] [2023-08-30 22:52:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 22:52:38,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 22:52:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 22:52:38,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 22:52:38,565 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 22:52:38,566 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-30 22:52:38,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 22:52:38,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-30 22:52:38,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-30 22:52:38,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 22:52:38,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 22:52:38,569 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 22:52:38,572 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 22:52:38,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 22:52:38,632 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 22:52:38,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-30 22:52:38,666 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-08-30 22:52:38,667 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 22:52:38,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-30 22:52:38,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 340 flow [2023-08-30 22:52:38,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 340 flow [2023-08-30 22:52:38,671 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 22:52:38,671 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-30 22:52:38,672 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-30 22:52:38,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-30 22:52:38,715 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-08-30 22:52:38,715 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 22:52:38,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-30 22:52:38,723 INFO L119 LiptonReduction]: Number of co-enabled transitions 11960 [2023-08-30 22:52:42,894 INFO L134 LiptonReduction]: Checked pairs total: 17804 [2023-08-30 22:52:42,894 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-30 22:52:42,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 22:52:42,897 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;@2dd27692, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 22:52:42,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 22:52:42,900 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 22:52:42,900 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 22:52:42,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:42,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 22:52:42,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 22:52:42,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1777037829, now seen corresponding path program 1 times [2023-08-30 22:52:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825435652] [2023-08-30 22:52:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:52:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:52:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:52:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825435652] [2023-08-30 22:52:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825435652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:52:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:52:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 22:52:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486549962] [2023-08-30 22:52:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:52:42,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 22:52:42,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:52:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 22:52:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 22:52:43,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2023-08-30 22:52:43,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:43,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:52:43,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2023-08-30 22:52:43,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:52:43,294 INFO L130 PetriNetUnfolder]: 1065/1643 cut-off events. [2023-08-30 22:52:43,294 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-30 22:52:43,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1643 events. 1065/1643 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8613 event pairs, 735 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 770. Up to 1612 conditions per place. [2023-08-30 22:52:43,307 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-30 22:52:43,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2023-08-30 22:52:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 22:52:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 22:52:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-30 22:52:43,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2023-08-30 22:52:43,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-30 22:52:43,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-30 22:52:43,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:52:43,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-30 22:52:43,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:43,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:43,339 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:43,340 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 337 transitions. [2023-08-30 22:52:43,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2023-08-30 22:52:43,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 22:52:43,348 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-08-30 22:52:43,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2023-08-30 22:52:43,353 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-30 22:52:43,354 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-08-30 22:52:43,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:43,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:43,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:52:43,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 22:52:43,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 22:52:43,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1668596586, now seen corresponding path program 1 times [2023-08-30 22:52:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489595736] [2023-08-30 22:52:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:52:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:52:44,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:52:44,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489595736] [2023-08-30 22:52:44,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489595736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:52:44,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:52:44,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 22:52:44,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085488607] [2023-08-30 22:52:44,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:52:44,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 22:52:44,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:52:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 22:52:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 22:52:44,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 306 [2023-08-30 22:52:44,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:44,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:52:44,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 306 [2023-08-30 22:52:44,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:52:45,732 INFO L130 PetriNetUnfolder]: 2445/3725 cut-off events. [2023-08-30 22:52:45,732 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-30 22:52:45,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7548 conditions, 3725 events. 2445/3725 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 22069 event pairs, 281 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 7543. Up to 1831 conditions per place. [2023-08-30 22:52:45,751 INFO L137 encePairwiseOnDemand]: 289/306 looper letters, 194 selfloop transitions, 69 changer transitions 0/266 dead transitions. [2023-08-30 22:52:45,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 266 transitions, 1103 flow [2023-08-30 22:52:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 22:52:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 22:52:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1963 transitions. [2023-08-30 22:52:45,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45821661998132585 [2023-08-30 22:52:45,756 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1963 transitions. [2023-08-30 22:52:45,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1963 transitions. [2023-08-30 22:52:45,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:52:45,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1963 transitions. [2023-08-30 22:52:45,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 140.21428571428572) internal successors, (1963), 14 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:45,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:45,772 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:45,772 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 14 states and 1963 transitions. [2023-08-30 22:52:45,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 266 transitions, 1103 flow [2023-08-30 22:52:45,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 266 transitions, 1103 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 22:52:45,777 INFO L231 Difference]: Finished difference. Result has 67 places, 130 transitions, 598 flow [2023-08-30 22:52:45,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=598, PETRI_PLACES=67, PETRI_TRANSITIONS=130} [2023-08-30 22:52:45,778 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-08-30 22:52:45,778 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 130 transitions, 598 flow [2023-08-30 22:52:45,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:45,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:45,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:52:45,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 22:52:45,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 22:52:45,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1666360739, now seen corresponding path program 1 times [2023-08-30 22:52:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921327546] [2023-08-30 22:52:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:52:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:52:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:52:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921327546] [2023-08-30 22:52:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921327546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:52:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:52:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 22:52:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561999263] [2023-08-30 22:52:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:52:46,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 22:52:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:52:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 22:52:46,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 22:52:46,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 306 [2023-08-30 22:52:46,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 130 transitions, 598 flow. Second operand has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:46,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:52:46,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 306 [2023-08-30 22:52:46,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:52:48,169 INFO L130 PetriNetUnfolder]: 3426/5268 cut-off events. [2023-08-30 22:52:48,170 INFO L131 PetriNetUnfolder]: For 4907/4918 co-relation queries the response was YES. [2023-08-30 22:52:48,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15192 conditions, 5268 events. 3426/5268 cut-off events. For 4907/4918 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 32919 event pairs, 1265 based on Foata normal form. 3/4374 useless extension candidates. Maximal degree in co-relation 15175. Up to 3867 conditions per place. [2023-08-30 22:52:48,212 INFO L137 encePairwiseOnDemand]: 289/306 looper letters, 257 selfloop transitions, 50 changer transitions 0/310 dead transitions. [2023-08-30 22:52:48,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 310 transitions, 1789 flow [2023-08-30 22:52:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 22:52:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 22:52:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1818 transitions. [2023-08-30 22:52:48,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45701357466063347 [2023-08-30 22:52:48,219 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1818 transitions. [2023-08-30 22:52:48,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1818 transitions. [2023-08-30 22:52:48,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:52:48,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1818 transitions. [2023-08-30 22:52:48,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 139.84615384615384) internal successors, (1818), 13 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:48,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:48,237 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:48,237 INFO L175 Difference]: Start difference. First operand has 67 places, 130 transitions, 598 flow. Second operand 13 states and 1818 transitions. [2023-08-30 22:52:48,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 310 transitions, 1789 flow [2023-08-30 22:52:48,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 310 transitions, 1789 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 22:52:48,277 INFO L231 Difference]: Finished difference. Result has 85 places, 183 transitions, 1005 flow [2023-08-30 22:52:48,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1005, PETRI_PLACES=85, PETRI_TRANSITIONS=183} [2023-08-30 22:52:48,284 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-08-30 22:52:48,284 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 183 transitions, 1005 flow [2023-08-30 22:52:48,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:48,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:48,286 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-30 22:52:48,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 22:52:48,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 22:52:48,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash -411397135, now seen corresponding path program 1 times [2023-08-30 22:52:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472327715] [2023-08-30 22:52:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 22:52:48,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 22:52:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 22:52:48,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 22:52:48,315 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 22:52:48,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-08-30 22:52:48,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 22:52:48,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-30 22:52:48,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-08-30 22:52:48,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-08-30 22:52:48,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-08-30 22:52:48,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 22:52:48,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 22:52:48,317 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-30 22:52:48,318 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 22:52:48,318 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-30 22:52:48,390 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 22:52:48,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 230 transitions, 481 flow [2023-08-30 22:52:48,433 INFO L130 PetriNetUnfolder]: 25/264 cut-off events. [2023-08-30 22:52:48,433 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 22:52:48,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 264 events. 25/264 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1004 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2023-08-30 22:52:48,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 230 transitions, 481 flow [2023-08-30 22:52:48,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 230 transitions, 481 flow [2023-08-30 22:52:48,438 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 22:52:48,438 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 230 transitions, 481 flow [2023-08-30 22:52:48,439 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 230 transitions, 481 flow [2023-08-30 22:52:48,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 230 transitions, 481 flow [2023-08-30 22:52:48,463 INFO L130 PetriNetUnfolder]: 25/264 cut-off events. [2023-08-30 22:52:48,464 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 22:52:48,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 264 events. 25/264 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1004 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2023-08-30 22:52:48,479 INFO L119 LiptonReduction]: Number of co-enabled transitions 30810 [2023-08-30 22:52:54,359 INFO L134 LiptonReduction]: Checked pairs total: 46397 [2023-08-30 22:52:54,360 INFO L136 LiptonReduction]: Total number of compositions: 198 [2023-08-30 22:52:54,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 22:52:54,362 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;@2dd27692, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 22:52:54,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-30 22:52:54,365 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 22:52:54,365 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 22:52:54,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:54,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 22:52:54,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-08-30 22:52:54,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -72499651, now seen corresponding path program 1 times [2023-08-30 22:52:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797480492] [2023-08-30 22:52:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:52:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:52:54,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:52:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797480492] [2023-08-30 22:52:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797480492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:52:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:52:54,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 22:52:54,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889967829] [2023-08-30 22:52:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:52:54,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 22:52:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:52:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 22:52:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 22:52:54,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 428 [2023-08-30 22:52:54,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 171 flow. Second operand has 2 states, 2 states have (on average 204.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:54,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:52:54,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 428 [2023-08-30 22:52:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:52:57,717 INFO L130 PetriNetUnfolder]: 27945/37185 cut-off events. [2023-08-30 22:52:57,717 INFO L131 PetriNetUnfolder]: For 2032/2032 co-relation queries the response was YES. [2023-08-30 22:52:57,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75427 conditions, 37185 events. 27945/37185 cut-off events. For 2032/2032 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 219213 event pairs, 19935 based on Foata normal form. 0/25591 useless extension candidates. Maximal degree in co-relation 3351. Up to 36684 conditions per place. [2023-08-30 22:52:58,060 INFO L137 encePairwiseOnDemand]: 421/428 looper letters, 65 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-30 22:52:58,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 287 flow [2023-08-30 22:52:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 22:52:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 22:52:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 474 transitions. [2023-08-30 22:52:58,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5537383177570093 [2023-08-30 22:52:58,063 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 474 transitions. [2023-08-30 22:52:58,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 474 transitions. [2023-08-30 22:52:58,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:52:58,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 474 transitions. [2023-08-30 22:52:58,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:58,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:58,067 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:58,067 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 171 flow. Second operand 2 states and 474 transitions. [2023-08-30 22:52:58,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 287 flow [2023-08-30 22:52:58,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 281 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 22:52:58,072 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 151 flow [2023-08-30 22:52:58,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-08-30 22:52:58,075 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-08-30 22:52:58,075 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 151 flow [2023-08-30 22:52:58,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 204.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:58,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:52:58,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:52:58,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 22:52:58,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-08-30 22:52:58,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:52:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash -945290628, now seen corresponding path program 1 times [2023-08-30 22:52:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:52:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438965587] [2023-08-30 22:52:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:52:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:52:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:52:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:52:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:52:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438965587] [2023-08-30 22:52:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438965587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:52:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:52:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 22:52:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748340195] [2023-08-30 22:52:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:52:58,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 22:52:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:52:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 22:52:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 22:52:58,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 428 [2023-08-30 22:52:58,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 151 flow. Second operand has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:52:58,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:52:58,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 428 [2023-08-30 22:52:58,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:53:03,735 INFO L130 PetriNetUnfolder]: 43458/57679 cut-off events. [2023-08-30 22:53:03,736 INFO L131 PetriNetUnfolder]: For 1114/1114 co-relation queries the response was YES. [2023-08-30 22:53:03,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116416 conditions, 57679 events. 43458/57679 cut-off events. For 1114/1114 co-relation queries the response was YES. Maximal size of possible extension queue 3216. Compared 363584 event pairs, 7244 based on Foata normal form. 0/40711 useless extension candidates. Maximal degree in co-relation 116410. Up to 34780 conditions per place. [2023-08-30 22:53:04,103 INFO L137 encePairwiseOnDemand]: 405/428 looper letters, 309 selfloop transitions, 52 changer transitions 0/364 dead transitions. [2023-08-30 22:53:04,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 364 transitions, 1540 flow [2023-08-30 22:53:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 22:53:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 22:53:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2314 transitions. [2023-08-30 22:53:04,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915038232795242 [2023-08-30 22:53:04,111 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2314 transitions. [2023-08-30 22:53:04,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2314 transitions. [2023-08-30 22:53:04,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:53:04,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2314 transitions. [2023-08-30 22:53:04,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 210.36363636363637) internal successors, (2314), 11 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:53:04,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 428.0) internal successors, (5136), 12 states have internal predecessors, (5136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:53:04,125 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 428.0) internal successors, (5136), 12 states have internal predecessors, (5136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:53:04,125 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 151 flow. Second operand 11 states and 2314 transitions. [2023-08-30 22:53:04,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 364 transitions, 1540 flow [2023-08-30 22:53:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 364 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 22:53:04,131 INFO L231 Difference]: Finished difference. Result has 79 places, 122 transitions, 535 flow [2023-08-30 22:53:04,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=535, PETRI_PLACES=79, PETRI_TRANSITIONS=122} [2023-08-30 22:53:04,132 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 18 predicate places. [2023-08-30 22:53:04,133 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 122 transitions, 535 flow [2023-08-30 22:53:04,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:53:04,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:53:04,134 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:53:04,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 22:53:04,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-08-30 22:53:04,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:53:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash 945174436, now seen corresponding path program 1 times [2023-08-30 22:53:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:53:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704063538] [2023-08-30 22:53:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:53:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:53:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:53:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:53:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:53:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704063538] [2023-08-30 22:53:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704063538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:53:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063406910] [2023-08-30 22:53:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:53:04,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:53:04,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:53:04,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 22:53:04,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 22:53:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:53:04,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-30 22:53:04,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:53:04,916 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 22:53:04,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-30 22:53:05,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-30 22:53:05,083 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 22:53:05,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 22:53:05,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:53:05,347 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-30 22:53:05,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 120 [2023-08-30 22:53:05,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-30 22:53:05,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-08-30 22:53:05,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-08-30 22:53:05,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2023-08-30 22:53:05,524 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 9 treesize of output 7 [2023-08-30 22:53:06,286 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-08-30 22:53:06,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 124 [2023-08-30 22:53:06,319 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 7 treesize of output 5 [2023-08-30 22:53:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:53:06,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:53:06,525 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_152 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (< (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)) is different from false [2023-08-30 22:53:06,631 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse0 (= .cse1 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_149 (Array Int Int)) (aux_mod_v_ArrVal_145_29 Int) (v_ArrVal_152 (Array Int Int)) (v_ArrVal_146 (Array Int Int)) (aux_div_v_ArrVal_145_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_147) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_149) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_146) |c_~#value~0.base| v_ArrVal_148) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_145_29 4294967296) aux_mod_v_ArrVal_145_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (> 0 aux_mod_v_ArrVal_145_29) (< .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_145_29 4294967296) (= aux_mod_v_ArrVal_145_29 0))))) (or .cse0 (forall ((v_ArrVal_152 (Array Int Int)) (v_ArrVal_144 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_144 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))))))) is different from false [2023-08-30 22:53:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:53:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063406910] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 22:53:07,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 22:53:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-30 22:53:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444687096] [2023-08-30 22:53:07,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 22:53:07,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 22:53:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:53:07,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 22:53:07,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=263, Unknown=11, NotChecked=70, Total=420 [2023-08-30 22:53:07,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 428 [2023-08-30 22:53:07,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 122 transitions, 535 flow. Second operand has 21 states, 21 states have (on average 145.28571428571428) internal successors, (3051), 21 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:53:07,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:53:07,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 428 [2023-08-30 22:53:07,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:53:07,774 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|))) (and (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 5)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= 5 |c_~#dec_flag~0.base|) (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 0) (let ((.cse3 (select |c_#memory_int| 3))) (let ((.cse0 (= (select .cse3 0) 1)) (.cse1 (= (select (select |c_#memory_int| 5) 0) 0))) (or (and (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 4) .cse0 .cse1) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (store (store (store (store (store (store |c_#memory_int| 4 v_DerPreprocessor_1) 3 v_DerPreprocessor_2) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_3) 4 v_DerPreprocessor_1) 3 v_DerPreprocessor_2) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_3))) (and (= (select v_DerPreprocessor_3 0) (select .cse2 0)) (= .cse3 (select .cse4 3)) (= (select .cse4 4) (select |c_#memory_int| 4))))) .cse0 .cse1)))) (or (forall ((v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (< (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (= (mod (select .cse2 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)) (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0) (forall ((v_ArrVal_149 (Array Int Int)) (aux_mod_v_ArrVal_145_29 Int) (v_ArrVal_152 (Array Int Int)) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_div_v_ArrVal_145_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_147) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_149) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse6))) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_146) |c_~#value~0.base| v_ArrVal_148) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_145_29 4294967296) aux_mod_v_ArrVal_145_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (< (mod .cse6 4294967296) (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (> 0 aux_mod_v_ArrVal_145_29) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (>= aux_mod_v_ArrVal_145_29 4294967296) (not (= (mod (select (select .cse7 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= aux_mod_v_ArrVal_145_29 0))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (not (= 5 |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3)) (= |c_~#dec_flag~0.offset| 0) (forall ((v_ArrVal_149 (Array Int Int)) (aux_mod_v_ArrVal_145_29 Int) (v_ArrVal_142 (Array Int Int)) (v_ArrVal_152 (Array Int Int)) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_div_v_ArrVal_145_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_142))) (let ((.cse9 (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse8 (store (store (store (store .cse10 |c_~#inc_flag~0.base| v_ArrVal_147) |c_~#value~0.base| (store (select (store .cse10 |c_~#inc_flag~0.base| v_ArrVal_149) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse9 1))) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store .cse10 |c_~#inc_flag~0.base| v_ArrVal_146) |c_~#value~0.base| v_ArrVal_148) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_145_29 4294967296) aux_mod_v_ArrVal_145_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (> 0 aux_mod_v_ArrVal_145_29) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (>= aux_mod_v_ArrVal_145_29 4294967296) (< (mod .cse9 4294967296) (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= aux_mod_v_ArrVal_145_29 0)))))))) is different from true [2023-08-30 22:53:09,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:15,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:24,745 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-08-30 22:53:34,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:37,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:38,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:42,882 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-08-30 22:53:44,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:53,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:53:55,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:00,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:04,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:07,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-08-30 22:54:17,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:28,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:32,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:35,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:37,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:40,056 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-08-30 22:54:52,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:55,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:57,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:54:59,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:01,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:03,847 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-08-30 22:55:06,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:07,352 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-08-30 22:55:09,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:18,024 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse3 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse0 (mod .cse2 4294967296))) (and (forall ((v_ArrVal_149 (Array Int Int)) (aux_mod_v_ArrVal_145_29 Int) (v_ArrVal_152 (Array Int Int)) (v_ArrVal_146 (Array Int Int)) (aux_div_v_ArrVal_145_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_147) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_149) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse2))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_146) |c_~#value~0.base| v_ArrVal_148) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_145_29 4294967296) aux_mod_v_ArrVal_145_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (> 0 aux_mod_v_ArrVal_145_29) (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_145_29 4294967296) (= aux_mod_v_ArrVal_145_29 0)))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_152 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (< .cse3 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0) (= |c_~#value~0.base| 3) (or (< .cse3 .cse0) (not (= (mod (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3)) (forall ((v_ArrVal_149 (Array Int Int)) (aux_mod_v_ArrVal_145_29 Int) (v_ArrVal_142 (Array Int Int)) (v_ArrVal_152 (Array Int Int)) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_div_v_ArrVal_145_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_142))) (let ((.cse6 (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse5 (store (store (store (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_147) |c_~#value~0.base| (store (select (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_149) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse6 1))) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store .cse7 |c_~#inc_flag~0.base| v_ArrVal_146) |c_~#value~0.base| v_ArrVal_148) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_145_29 4294967296) aux_mod_v_ArrVal_145_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_152))) (or (> 0 aux_mod_v_ArrVal_145_29) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (>= aux_mod_v_ArrVal_145_29 4294967296) (< (mod .cse6 4294967296) (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= aux_mod_v_ArrVal_145_29 0))))))))) is different from false [2023-08-30 22:55:21,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:26,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:29,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:32,020 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-08-30 22:55:33,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:36,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:38,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:43,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:45,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:47,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:49,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:51,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:53,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-08-30 22:55:57,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:55:59,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:56:06,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:56:11,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:56:13,631 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-08-30 22:56:15,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:56:21,862 INFO L130 PetriNetUnfolder]: 96894/133951 cut-off events. [2023-08-30 22:56:21,863 INFO L131 PetriNetUnfolder]: For 365898/366045 co-relation queries the response was YES. [2023-08-30 22:56:22,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440776 conditions, 133951 events. 96894/133951 cut-off events. For 365898/366045 co-relation queries the response was YES. Maximal size of possible extension queue 6978. Compared 985424 event pairs, 7586 based on Foata normal form. 3281/115568 useless extension candidates. Maximal degree in co-relation 440761. Up to 57077 conditions per place. [2023-08-30 22:56:23,010 INFO L137 encePairwiseOnDemand]: 370/428 looper letters, 1017 selfloop transitions, 786 changer transitions 0/1806 dead transitions. [2023-08-30 22:56:23,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 1806 transitions, 11417 flow [2023-08-30 22:56:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-30 22:56:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-30 22:56:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 9495 transitions. [2023-08-30 22:56:23,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41082554517133957 [2023-08-30 22:56:23,035 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 9495 transitions. [2023-08-30 22:56:23,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 9495 transitions. [2023-08-30 22:56:23,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:56:23,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 9495 transitions. [2023-08-30 22:56:23,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 175.83333333333334) internal successors, (9495), 54 states have internal predecessors, (9495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:56:23,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 428.0) internal successors, (23540), 55 states have internal predecessors, (23540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:56:23,115 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 428.0) internal successors, (23540), 55 states have internal predecessors, (23540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:56:23,115 INFO L175 Difference]: Start difference. First operand has 79 places, 122 transitions, 535 flow. Second operand 54 states and 9495 transitions. [2023-08-30 22:56:23,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 1806 transitions, 11417 flow [2023-08-30 22:56:23,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 1806 transitions, 11417 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 22:56:23,538 INFO L231 Difference]: Finished difference. Result has 178 places, 949 transitions, 8800 flow [2023-08-30 22:56:23,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=8800, PETRI_PLACES=178, PETRI_TRANSITIONS=949} [2023-08-30 22:56:23,539 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 117 predicate places. [2023-08-30 22:56:23,539 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 949 transitions, 8800 flow [2023-08-30 22:56:23,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 145.28571428571428) internal successors, (3051), 21 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:56:23,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:56:23,541 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:56:23,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 22:56:23,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:56:23,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-08-30 22:56:23,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:56:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 933643335, now seen corresponding path program 1 times [2023-08-30 22:56:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:56:23,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566793611] [2023-08-30 22:56:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:56:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:56:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:56:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:56:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:56:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566793611] [2023-08-30 22:56:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566793611] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:56:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840214499] [2023-08-30 22:56:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:56:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:56:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:56:25,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 22:56:25,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 22:56:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:56:25,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-30 22:56:25,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:56:25,385 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-08-30 22:56:25,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2023-08-30 22:56:25,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-30 22:56:25,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-30 22:56:25,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-30 22:56:25,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:56:25,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:56:25,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:56:25,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2023-08-30 22:56:25,579 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-08-30 22:56:25,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 74 [2023-08-30 22:56:25,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2023-08-30 22:56:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:56:25,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 22:56:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840214499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:56:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 22:56:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2023-08-30 22:56:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300827288] [2023-08-30 22:56:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:56:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 22:56:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:56:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 22:56:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-08-30 22:56:25,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 428 [2023-08-30 22:56:25,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 949 transitions, 8800 flow. Second operand has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:56:25,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:56:25,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 428 [2023-08-30 22:56:25,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:56:58,962 INFO L130 PetriNetUnfolder]: 109512/150872 cut-off events. [2023-08-30 22:56:58,962 INFO L131 PetriNetUnfolder]: For 4518166/4519599 co-relation queries the response was YES. [2023-08-30 22:57:00,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270217 conditions, 150872 events. 109512/150872 cut-off events. For 4518166/4519599 co-relation queries the response was YES. Maximal size of possible extension queue 7573. Compared 1106955 event pairs, 24720 based on Foata normal form. 1265/138962 useless extension candidates. Maximal degree in co-relation 1270156. Up to 83212 conditions per place. [2023-08-30 22:57:01,879 INFO L137 encePairwiseOnDemand]: 415/428 looper letters, 1039 selfloop transitions, 244 changer transitions 0/1286 dead transitions. [2023-08-30 22:57:01,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1286 transitions, 15825 flow [2023-08-30 22:57:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 22:57:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 22:57:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1359 transitions. [2023-08-30 22:57:01,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292056074766355 [2023-08-30 22:57:01,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1359 transitions. [2023-08-30 22:57:01,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1359 transitions. [2023-08-30 22:57:01,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:57:01,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1359 transitions. [2023-08-30 22:57:01,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.5) internal successors, (1359), 6 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:57:01,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:57:01,889 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:57:01,890 INFO L175 Difference]: Start difference. First operand has 178 places, 949 transitions, 8800 flow. Second operand 6 states and 1359 transitions. [2023-08-30 22:57:01,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1286 transitions, 15825 flow [2023-08-30 22:58:29,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1286 transitions, 14437 flow, removed 680 selfloop flow, removed 3 redundant places. [2023-08-30 22:58:29,349 INFO L231 Difference]: Finished difference. Result has 182 places, 1051 transitions, 9380 flow [2023-08-30 22:58:29,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=7602, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9380, PETRI_PLACES=182, PETRI_TRANSITIONS=1051} [2023-08-30 22:58:29,350 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 121 predicate places. [2023-08-30 22:58:29,350 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1051 transitions, 9380 flow [2023-08-30 22:58:29,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:58:29,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:58:29,351 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:58:29,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 22:58:29,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-30 22:58:29,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-08-30 22:58:29,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:58:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash 264408931, now seen corresponding path program 1 times [2023-08-30 22:58:29,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:58:29,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81164914] [2023-08-30 22:58:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:58:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:58:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:58:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 22:58:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:58:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81164914] [2023-08-30 22:58:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81164914] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:58:30,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803442921] [2023-08-30 22:58:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:58:30,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:58:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:58:30,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 22:58:30,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 22:58:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:58:30,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-30 22:58:30,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:58:30,273 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 22:58:30,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-30 22:58:30,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-30 22:58:30,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-30 22:58:30,598 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 22:58:30,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 22:58:30,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:58:30,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:58:30,902 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-30 22:58:30,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-30 22:58:30,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-30 22:58:30,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-30 22:58:31,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-30 22:58:31,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-08-30 22:58:31,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:58:31,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:58:31,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2023-08-30 22:58:31,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:58:31,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:58:31,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:58:31,720 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:58:31,721 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:58:31,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:58:31,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2023-08-30 22:58:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 22:58:32,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:58:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 22:58:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803442921] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 22:58:33,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 22:58:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-30 22:58:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646722711] [2023-08-30 22:58:33,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 22:58:33,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 22:58:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:58:33,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 22:58:33,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=302, Unknown=3, NotChecked=0, Total=380 [2023-08-30 22:58:35,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:38,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:40,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:42,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-08-30 22:58:45,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:45,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 428 [2023-08-30 22:58:45,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1051 transitions, 9380 flow. Second operand has 20 states, 20 states have (on average 145.5) internal successors, (2910), 20 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 22:58:45,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:58:45,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 428 [2023-08-30 22:58:45,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:58:52,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:55,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:57,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:58:59,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:59:02,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:59:04,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:59:17,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:59:19,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 22:59:51,002 WARN L222 SmtUtils]: Spent 15.34s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 22:59:54,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:00:01,481 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-08-30 23:00:04,627 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-08-30 23:00:06,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:00:10,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 [0, 1] [2023-08-30 23:00:12,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:00:17,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 [0, 1] [2023-08-30 23:00:24,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:00:26,118 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-08-30 23:00:29,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:00:31,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:00:41,666 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-08-30 23:00:45,397 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 [0, 1] [2023-08-30 23:00:47,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:00:48,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:00:52,818 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 [0, 1] [2023-08-30 23:00:54,826 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 [0, 1] [2023-08-30 23:00:57,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:00:59,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:01:00,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:01:17,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:01:19,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:01:30,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:01:33,025 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-08-30 23:01:35,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:01:37,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:01:39,373 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-08-30 23:01:41,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-08-30 23:01:48,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:01:50,606 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 [0, 1] [2023-08-30 23:01:54,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:01:57,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:11,841 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse2 4294967296))) (and (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (|v_thr1Thread2of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_13| Int) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_13| v_ArrVal_299) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_13| v_ArrVal_301) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse2))) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_13| v_ArrVal_298) |c_~#value~0.base| v_ArrVal_300) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.offset| 1)))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread2of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_13|)))) (or (not (= (mod (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod |c_thr1Thread2of3ForFork0_inc_~inc__v~0#1| 4294967296) .cse0)) (= |c_thr1Thread2of3ForFork0_inc_~inc__v~0#1| 0) (= |c_~#value~0.base| 3) (not (= 3 |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|))))) is different from false [2023-08-30 23:02:14,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:16,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:23,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:25,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:27,911 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-08-30 23:02:29,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:32,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-08-30 23:02:34,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:36,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:39,290 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-08-30 23:02:44,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:46,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:49,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:50,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:02:52,694 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-08-30 23:03:08,535 WARN L222 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 23:03:14,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:16,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:18,966 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-08-30 23:03:21,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:25,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:27,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:33,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:35,874 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-08-30 23:03:38,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:40,224 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-08-30 23:03:41,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:43,471 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-08-30 23:03:46,904 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-08-30 23:03:51,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:03:53,098 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-08-30 23:04:04,593 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-08-30 23:04:06,600 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-08-30 23:04:10,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:16,641 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-08-30 23:04:18,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:21,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:23,042 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-08-30 23:04:25,177 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-08-30 23:04:28,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:33,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:34,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:37,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:38,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:40,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:42,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:44,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:46,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:49,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:51,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:04:54,137 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-08-30 23:05:05,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:07,832 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-08-30 23:05:11,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:12,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:27,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:05:29,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 23:05:32,134 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-08-30 23:05:34,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:35,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:37,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:40,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:41,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:44,526 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-08-30 23:05:57,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:05:59,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:02,014 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-08-30 23:06:06,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:08,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:10,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-08-30 23:06:19,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:21,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:23,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:25,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 23:06:28,803 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] Killed by 15