./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 14:16:58,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 14:16:58,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 14:16:58,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 14:16:58,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 14:16:58,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 14:16:58,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 14:16:58,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 14:16:58,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 14:16:58,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 14:16:58,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 14:16:58,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 14:16:58,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 14:16:58,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 14:16:58,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 14:16:58,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 14:16:58,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 14:16:58,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 14:16:58,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 14:16:58,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 14:16:58,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 14:16:58,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 14:16:58,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 14:16:58,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 14:16:58,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 14:16:58,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 14:16:58,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 14:16:58,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 14:16:58,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 14:16:58,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 14:16:58,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:16:58,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 14:16:58,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 14:16:58,789 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 14:16:58,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 14:16:58,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 14:16:58,790 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 14:16:58,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 14:16:58,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 14:16:58,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 14:16:58,791 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 14:16:58,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-18 14:16:59,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 14:16:59,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 14:16:59,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 14:16:59,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 14:16:59,071 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 14:16:59,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-10-18 14:17:00,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 14:17:00,759 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 14:17:00,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-10-18 14:17:00,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5332ec4d1/1e40a0fc13cf45afa151bee4ba05f652/FLAG44b788d8d [2024-10-18 14:17:01,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5332ec4d1/1e40a0fc13cf45afa151bee4ba05f652 [2024-10-18 14:17:01,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 14:17:01,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 14:17:01,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 14:17:01,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 14:17:01,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 14:17:01,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66024036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01, skipping insertion in model container [2024-10-18 14:17:01,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 14:17:01,361 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2500,2513] [2024-10-18 14:17:01,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:17:01,379 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 14:17:01,399 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2500,2513] [2024-10-18 14:17:01,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:17:01,423 INFO L204 MainTranslator]: Completed translation [2024-10-18 14:17:01,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01 WrapperNode [2024-10-18 14:17:01,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 14:17:01,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 14:17:01,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 14:17:01,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 14:17:01,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,459 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2024-10-18 14:17:01,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 14:17:01,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 14:17:01,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 14:17:01,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 14:17:01,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 14:17:01,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 14:17:01,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 14:17:01,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 14:17:01,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (1/1) ... [2024-10-18 14:17:01,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:17:01,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:17:01,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 14:17:01,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 14:17:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 14:17:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 14:17:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 14:17:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 14:17:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 14:17:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 14:17:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 14:17:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-18 14:17:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 14:17:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 14:17:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 14:17:01,604 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 14:17:01,726 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 14:17:01,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 14:17:02,011 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 14:17:02,012 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 14:17:02,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 14:17:02,319 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-18 14:17:02,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:17:02 BoogieIcfgContainer [2024-10-18 14:17:02,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 14:17:02,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 14:17:02,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 14:17:02,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 14:17:02,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 02:17:01" (1/3) ... [2024-10-18 14:17:02,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6047fa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:17:02, skipping insertion in model container [2024-10-18 14:17:02,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:17:01" (2/3) ... [2024-10-18 14:17:02,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6047fa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:17:02, skipping insertion in model container [2024-10-18 14:17:02,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:17:02" (3/3) ... [2024-10-18 14:17:02,331 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2024-10-18 14:17:02,345 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 14:17:02,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 14:17:02,345 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 14:17:02,386 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-18 14:17:02,425 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:17:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:17:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:17:02,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 14:17:02,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 14:17:02,517 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:17:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:17:02,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:17:02,549 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@569034b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 14:17:02,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-18 14:17:02,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:17:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:17:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 176020635, now seen corresponding path program 1 times [2024-10-18 14:17:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:17:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663920969] [2024-10-18 14:17:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 14:17:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:17:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663920969] [2024-10-18 14:17:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663920969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:17:03,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:17:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:17:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055358055] [2024-10-18 14:17:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:17:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 14:17:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:17:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 14:17:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 14:17:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:03,348 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:17:03,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:17:03,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:03,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:03,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 14:17:03,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:17:03,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:17:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1103723602, now seen corresponding path program 1 times [2024-10-18 14:17:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:17:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126417714] [2024-10-18 14:17:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 14:17:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:17:04,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126417714] [2024-10-18 14:17:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126417714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:17:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882595667] [2024-10-18 14:17:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:04,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:17:04,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:17:04,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:17:04,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 14:17:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:04,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-18 14:17:04,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:17:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-18 14:17:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 14:17:04,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:17:04,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:17:04,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 37 [2024-10-18 14:17:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 14:17:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882595667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:17:04,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:17:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-10-18 14:17:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708224946] [2024-10-18 14:17:04,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:17:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-18 14:17:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:17:04,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-18 14:17:04,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-18 14:17:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:04,763 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:17:04,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:17:04,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:04,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:17:05,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-18 14:17:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-18 14:17:05,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:17:05,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:17:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1692399723, now seen corresponding path program 1 times [2024-10-18 14:17:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:17:05,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511023757] [2024-10-18 14:17:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:17:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:17:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511023757] [2024-10-18 14:17:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511023757] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:17:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686166699] [2024-10-18 14:17:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:17:06,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:17:06,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:17:06,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-18 14:17:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:06,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-18 14:17:06,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:17:06,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-18 14:17:06,821 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-10-18 14:17:06,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 61 [2024-10-18 14:17:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:17:06,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:17:07,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2024-10-18 14:17:07,731 INFO L349 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2024-10-18 14:17:07,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 406 treesize of output 335 [2024-10-18 14:17:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:17:10,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686166699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:17:10,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:17:10,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-18 14:17:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145081981] [2024-10-18 14:17:10,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:17:10,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-18 14:17:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:17:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-18 14:17:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2024-10-18 14:17:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:10,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:17:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:17:10,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:10,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:17:10,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:17:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:17:11,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 14:17:11,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:17:11,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:17:11,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:17:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash 196277, now seen corresponding path program 2 times [2024-10-18 14:17:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:17:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196402554] [2024-10-18 14:17:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:17:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:17:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196402554] [2024-10-18 14:17:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196402554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:17:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659719603] [2024-10-18 14:17:12,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 14:17:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:17:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:17:12,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:17:12,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-18 14:17:12,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 14:17:12,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:17:12,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-18 14:17:12,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:17:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:17:12,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:17:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:17:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659719603] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:17:12,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:17:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-10-18 14:17:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106139680] [2024-10-18 14:17:12,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:17:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-18 14:17:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:17:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-18 14:17:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-18 14:17:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:12,598 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:17:12,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:17:12,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:12,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:17:12,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:17:12,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:16,514 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 [] [2024-10-18 14:17:18,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:17:21,150 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 [] [2024-10-18 14:17:24,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:17:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:17:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:17:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-18 14:17:24,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-18 14:17:24,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:17:24,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:17:24,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:17:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash -511996649, now seen corresponding path program 3 times [2024-10-18 14:17:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:17:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208488623] [2024-10-18 14:17:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:17:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:17:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:17:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:17:27,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:17:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208488623] [2024-10-18 14:17:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208488623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:17:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856714358] [2024-10-18 14:17:27,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 14:17:27,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:17:27,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:17:27,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:17:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 14:17:27,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-18 14:17:27,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:17:27,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-18 14:17:27,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:17:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:17:27,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:17:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:17:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856714358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:17:29,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:17:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 50 [2024-10-18 14:17:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233918917] [2024-10-18 14:17:29,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:17:29,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-18 14:17:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:17:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-18 14:17:30,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2062, Unknown=0, NotChecked=0, Total=2450 [2024-10-18 14:17:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:30,006 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:17:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:17:30,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 14:17:30,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:17:30,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:17:30,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-18 14:17:30,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:17:35,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse17 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse12)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse11 (+ 2 .cse17)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse16 (+ .cse6 2))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (< (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod (+ 4294967295 c_~n~0) 4294967296)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse11) (< .cse12 .cse10)) (or (< .cse14 14) (< 14 .cse7)) (or (< .cse15 .cse7) (< .cse14 .cse16)) (or (< .cse17 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (< .cse13 (+ (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296) 2))) (or (< .cse15 .cse4) (< .cse7 .cse16))))) is different from false [2024-10-18 14:17:37,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse19 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse19)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse18 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse20 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse11 (+ .cse15 2)) (.cse21 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse22 (+ .cse6 2)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse17 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (.cse14 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (let ((.cse16 (mod (+ 4294967295 c_~n~0) 4294967296))) (or (< .cse14 (mod c_~n~0 4294967296)) (< .cse15 .cse16) (< .cse16 (+ .cse17 1)))) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse18) (< .cse19 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse18) (< .cse19 .cse10)) (or (< .cse20 14) (< 14 .cse7)) (or (< .cse21 .cse7) (< .cse20 .cse22)) (or (< .cse12 .cse14) (< .cse13 .cse11)) (or (< .cse21 .cse4) (< .cse7 .cse22)) (or (< .cse13 (+ 2 .cse17)) (< .cse15 .cse14))))) is different from false [2024-10-18 14:17:44,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse18)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse17 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse19 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse11 (+ .cse15 2)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse21 (+ .cse6 2))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (let ((.cse16 (mod (+ 4294967295 c_~n~0) 4294967296))) (or (< .cse14 (mod c_~n~0 4294967296)) (< .cse15 .cse16) (< .cse16 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1)))) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse17) (< .cse18 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse17) (< .cse18 .cse10)) (or (< .cse19 14) (< 14 .cse7)) (or (< .cse20 .cse7) (< .cse19 .cse21)) (or (< .cse12 .cse14) (< .cse13 .cse11)) (or (< .cse20 .cse4) (< .cse7 .cse21))))) is different from false [2024-10-18 14:18:27,822 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 [] [2024-10-18 14:18:30,326 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 [] [2024-10-18 14:18:43,230 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 [] [2024-10-18 14:19:04,112 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 [] [2024-10-18 14:19:06,246 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 [] [2024-10-18 14:19:18,775 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 [] [2024-10-18 14:19:33,198 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 [] [2024-10-18 14:19:35,203 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 [] [2024-10-18 14:19:37,221 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 [] [2024-10-18 14:19:57,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 [] [2024-10-18 14:19:59,599 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 [] [2024-10-18 14:20:18,928 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 [] [2024-10-18 14:21:56,581 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 133 DAG size of output: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:23:04,322 WARN L286 SmtUtils]: Spent 26.67s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:23:07,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse1 (+ 2 .cse15)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse11 (+ .cse17 2)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse16 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse14) (< .cse15 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse14) (< .cse15 .cse10)) (or (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| (* 4294967296 (div (+ 4294967295 c_~n~0) 4294967296))) (+ (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) 14 c_~n~0)) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1|) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0))) (or (< (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) .cse7) (< (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296) (+ .cse6 2))) (or (< .cse12 .cse16) (< .cse13 .cse11)) (or (< .cse13 (+ 2 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< .cse17 .cse16))))) is different from false [2024-10-18 14:24:20,263 WARN L286 SmtUtils]: Spent 42.97s on a formula simplification. DAG size of input: 101 DAG size of output: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:24:39,648 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 116 DAG size of output: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:24:41,651 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 [] [2024-10-18 14:24:43,013 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 [] [2024-10-18 14:24:45,016 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 [] [2024-10-18 14:24:47,018 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 [] [2024-10-18 14:24:49,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:24:51,300 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 [] [2024-10-18 14:25:41,589 WARN L286 SmtUtils]: Spent 17.10s on a formula simplification. DAG size of input: 88 DAG size of output: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:25:42,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:25:45,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:25:47,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:25:49,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:25:52,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:26:19,712 WARN L286 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 107 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:26:36,621 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 63 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:26:38,626 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 [] [2024-10-18 14:26:40,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:26:42,126 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 [] [2024-10-18 14:26:44,841 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 [] [2024-10-18 14:26:46,846 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 [] [2024-10-18 14:26:48,850 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 [] [2024-10-18 14:26:50,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:26:52,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:26:54,715 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 [] [2024-10-18 14:26:56,933 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 [] [2024-10-18 14:26:58,935 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 [] [2024-10-18 14:27:00,936 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 [] [2024-10-18 14:27:10,292 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 [] [2024-10-18 14:27:12,327 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 [] [2024-10-18 14:27:14,329 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 [] [2024-10-18 14:27:16,344 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 [] [2024-10-18 14:27:18,529 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 [] [2024-10-18 14:27:21,198 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 [] [2024-10-18 14:27:24,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:27:27,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:27:29,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:27:34,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:27:36,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:28:47,057 WARN L286 SmtUtils]: Spent 27.76s on a formula simplification. DAG size of input: 98 DAG size of output: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 14:28:49,385 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 [] [2024-10-18 14:28:51,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:28:53,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296))) (let ((.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse4 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse3 (+ .cse9 2)) (.cse0 (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1| (* 4294967296 (div (+ 4294967295 c_~n~0) 4294967296)))) (.cse6 (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 4)) 4294967296) 4294967296)) (.cse7 (* (div (+ 9 .cse1 c_~n~0) 4294967296) 4294967296)) (.cse5 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse8 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (<= 6 |c_thread1Thread1of1ForFork1_~i~0#1|) (<= 5 |c_thread1Thread1of1ForFork1_~i~0#1|) (<= .cse0 (+ (* (div (+ .cse1 c_~n~0 11) 4294967296) 4294967296) 4294967294 c_~n~0 (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 6)) 4294967296) 4294967296))) (or (< .cse2 .cse3) (< .cse4 .cse5)) (<= .cse0 (+ .cse6 4294967294 c_~n~0 .cse7)) (or (< (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296) (+ 2 .cse4)) (< (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296) .cse2)) (or (< .cse4 .cse8) (< .cse5 .cse3)) (<= .cse0 (+ .cse6 c_~n~0 .cse7 4294967293)) (or (< .cse5 (+ 2 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< .cse9 .cse8))))) is different from false [2024-10-18 14:28:55,365 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 [] [2024-10-18 14:28:58,277 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 [] [2024-10-18 14:29:00,279 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 [] [2024-10-18 14:29:02,283 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 [] [2024-10-18 14:29:04,285 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 [] [2024-10-18 14:29:06,290 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 [] [2024-10-18 14:29:08,416 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 [] [2024-10-18 14:29:10,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:29:14,186 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 [] [2024-10-18 14:30:07,053 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 [] [2024-10-18 14:30:09,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:30:11,046 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 [] [2024-10-18 14:30:13,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:30:26,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:30:28,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 14:30:54,869 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 [] [2024-10-18 14:30:56,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:30:58,176 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 [] [2024-10-18 14:31:00,177 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 [] [2024-10-18 14:31:02,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 [] [2024-10-18 14:31:04,252 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 [] [2024-10-18 14:31:06,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-18 14:31:08,975 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 [] [2024-10-18 14:31:24,464 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 [] [2024-10-18 14:31:26,466 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 [] Killed by 15