./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR -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-3.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 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR -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-17 02:36:09,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 02:36:09,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 02:36:09,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 02:36:09,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 02:36:09,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 02:36:09,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 02:36:09,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 02:36:09,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 02:36:09,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 02:36:09,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 02:36:09,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 02:36:09,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 02:36:09,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 02:36:09,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 02:36:09,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 02:36:09,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 02:36:09,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 02:36:09,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 02:36:09,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 02:36:09,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 02:36:09,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 02:36:09,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 02:36:09,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 02:36:09,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 02:36:09,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 02:36:09,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 02:36:09,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 02:36:09,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 02:36:09,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 02:36:09,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 02:36:09,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 02:36:09,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 02:36:09,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 02:36:09,813 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 02:36:09,813 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 -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR [2024-10-17 02:36:10,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 02:36:10,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 02:36:10,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 02:36:10,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 02:36:10,051 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 02:36:10,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2024-10-17 02:36:11,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 02:36:11,446 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 02:36:11,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2024-10-17 02:36:11,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca84b118c/3f75ec41954948078b545f4d2771c43c/FLAG992eb4d7c [2024-10-17 02:36:11,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ca84b118c/3f75ec41954948078b545f4d2771c43c [2024-10-17 02:36:11,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 02:36:11,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 02:36:11,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 02:36:11,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 02:36:11,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 02:36:11,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 02:36:11" (1/1) ... [2024-10-17 02:36:11,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f30600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:11, skipping insertion in model container [2024-10-17 02:36:11,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 02:36:11" (1/1) ... [2024-10-17 02:36:11,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 02:36:12,042 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-3.wvr.c[2667,2680] [2024-10-17 02:36:12,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 02:36:12,057 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 02:36:12,078 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-3.wvr.c[2667,2680] [2024-10-17 02:36:12,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 02:36:12,098 INFO L204 MainTranslator]: Completed translation [2024-10-17 02:36:12,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12 WrapperNode [2024-10-17 02:36:12,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 02:36:12,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 02:36:12,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 02:36:12,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 02:36:12,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,127 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 155 [2024-10-17 02:36:12,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 02:36:12,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 02:36:12,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 02:36:12,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 02:36:12,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 02:36:12,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 02:36:12,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 02:36:12,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 02:36:12,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (1/1) ... [2024-10-17 02:36:12,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 02:36:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:36:12,187 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-17 02:36:12,189 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-17 02:36:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 02:36:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 02:36:12,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 02:36:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 02:36:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 02:36:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 02:36:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 02:36:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-17 02:36:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 02:36:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 02:36:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 02:36:12,228 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 02:36:12,313 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 02:36:12,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 02:36:12,536 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 02:36:12,536 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 02:36:12,734 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 02:36:12,734 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-17 02:36:12,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 02:36:12 BoogieIcfgContainer [2024-10-17 02:36:12,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 02:36:12,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 02:36:12,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 02:36:12,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 02:36:12,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 02:36:11" (1/3) ... [2024-10-17 02:36:12,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343c559e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 02:36:12, skipping insertion in model container [2024-10-17 02:36:12,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 02:36:12" (2/3) ... [2024-10-17 02:36:12,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343c559e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 02:36:12, skipping insertion in model container [2024-10-17 02:36:12,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 02:36:12" (3/3) ... [2024-10-17 02:36:12,745 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2024-10-17 02:36:12,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 02:36:12,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 02:36:12,759 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 02:36:12,805 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 02:36:12,844 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 02:36:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 02:36:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:36:12,847 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-17 02:36:12,850 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-17 02:36:12,928 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 02:36:12,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:36:12,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 02:36:12,949 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;@51cef88c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 02:36:12,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 02:36:13,246 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-17 02:36:13,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:36:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1385037369, now seen corresponding path program 1 times [2024-10-17 02:36:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 02:36:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829422711] [2024-10-17 02:36:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:36:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 02:36:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:36:13,580 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-17 02:36:13,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 02:36:13,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829422711] [2024-10-17 02:36:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829422711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 02:36:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 02:36:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 02:36:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151165019] [2024-10-17 02:36:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 02:36:13,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 02:36:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 02:36:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 02:36:13,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 02:36:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:36:13,607 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 02:36:13,608 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-17 02:36:13,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:36:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:36:13,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 02:36:13,654 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-17 02:36:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:36:13,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1522111068, now seen corresponding path program 1 times [2024-10-17 02:36:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 02:36:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285457239] [2024-10-17 02:36:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:36:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 02:36:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:36:13,929 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-17 02:36:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 02:36:13,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285457239] [2024-10-17 02:36:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285457239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 02:36:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407491779] [2024-10-17 02:36:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:36:13,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 02:36:13,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:36:13,958 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-17 02:36:13,961 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-17 02:36:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:36:14,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-17 02:36:14,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 02:36:14,106 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-17 02:36:14,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 02:36:14,382 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 115 treesize of output 109 [2024-10-17 02:36:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 02:36:14,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 02:36:15,846 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 33 treesize of output 29 [2024-10-17 02:36:15,856 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-17 02:36:15,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2024-10-17 02:36:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 02:36:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407491779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 02:36:15,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 02:36:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2024-10-17 02:36:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919604442] [2024-10-17 02:36:15,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 02:36:15,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-17 02:36:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 02:36:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-17 02:36:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-17 02:36:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:36:15,892 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 02:36:15,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 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-17 02:36:15,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:36:15,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:36:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:36:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:36:16,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 02:36:16,433 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-17 02:36:16,434 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-17 02:36:16,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:36:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash -321312551, now seen corresponding path program 1 times [2024-10-17 02:36:16,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 02:36:16,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193329023] [2024-10-17 02:36:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:36:16,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 02:36:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:36:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-17 02:36:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 02:36:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193329023] [2024-10-17 02:36:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193329023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 02:36:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845262180] [2024-10-17 02:36:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:36:16,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 02:36:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:36:16,676 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-17 02:36:16,677 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-17 02:36:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:36:16,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-17 02:36:16,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 02:36:16,787 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-17 02:36:17,024 INFO L349 Elim1Store]: treesize reduction 74, result has 14.9 percent of original size [2024-10-17 02:36:17,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 210 treesize of output 149 [2024-10-17 02:36:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 02:36:17,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 02:36:17,813 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 416 treesize of output 366 [2024-10-17 02:36:18,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 02:36:18,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 2848 treesize of output 1642 [2024-10-17 02:38:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 02:38:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845262180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 02:38:37,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 02:38:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2024-10-17 02:38:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464894310] [2024-10-17 02:38:37,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 02:38:37,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-17 02:38:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 02:38:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-17 02:38:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-17 02:38:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:38:37,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 02:38:37,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 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-17 02:38:37,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:38:37,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:38:37,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:38:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:38:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:38:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 02:38:37,444 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-17 02:38:37,635 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-17 02:38:37,636 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-17 02:38:37,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:38:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1425241175, now seen corresponding path program 2 times [2024-10-17 02:38:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 02:38:37,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822056032] [2024-10-17 02:38:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:38:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 02:38:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:38:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 02:38:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 02:38:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822056032] [2024-10-17 02:38:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822056032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 02:38:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018023981] [2024-10-17 02:38:38,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 02:38:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 02:38:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:38:38,269 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-17 02:38:38,269 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-17 02:38:38,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 02:38:38,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 02:38:38,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-17 02:38:38,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 02:38:38,416 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-17 02:38:38,446 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-17 02:38:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 02:38:39,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 02:38:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 02:38:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018023981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 02:38:42,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 02:38:42,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 33 [2024-10-17 02:38:42,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413200275] [2024-10-17 02:38:42,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 02:38:42,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-17 02:38:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 02:38:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-17 02:38:42,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2024-10-17 02:38:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:38:42,880 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 02:38:42,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 0 states have call successors, (0), 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-17 02:38:42,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:38:42,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:38:42,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 02:38:42,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:38:55,504 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-17 02:39:10,848 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-17 02:39:12,867 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-17 02:39:14,870 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-17 02:39:20,447 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-17 02:39:28,478 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-17 02:39:29,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-17 02:39:31,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-17 02:39:35,440 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-17 02:39:38,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-17 02:39:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:39:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:39:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 02:39:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-17 02:39:38,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-17 02:39:39,001 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-17 02:39:39,002 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-17 02:39:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:39:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -587050640, now seen corresponding path program 3 times [2024-10-17 02:39:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 02:39:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279191042] [2024-10-17 02:39:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:39:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 02:39:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:39:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-17 02:39:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 02:39:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279191042] [2024-10-17 02:39:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279191042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 02:39:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872871135] [2024-10-17 02:39:39,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 02:39:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 02:39:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:39:39,557 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-17 02:39:39,558 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-17 02:39:40,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-17 02:39:40,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 02:39:40,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-17 02:39:40,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 02:39:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 02:39:40,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 02:39:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 02:39:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872871135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 02:39:41,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 02:39:41,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 29 [2024-10-17 02:39:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637877564] [2024-10-17 02:39:41,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 02:39:41,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-17 02:39:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 02:39:41,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-17 02:39:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2024-10-17 02:39:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:39:41,151 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 02:39:41,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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-17 02:39:41,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:39:41,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:39:41,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 02:39:41,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-10-17 02:39:41,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:39:53,777 WARN L286 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 69 DAG size of output: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:40:01,051 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 60 DAG size of output: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:40:13,373 WARN L286 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 68 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:40:27,603 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-17 02:40:29,611 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-17 02:40:37,141 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 52 DAG size of output: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:40:39,144 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-17 02:40:41,670 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-17 02:40:43,674 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-17 02:40:45,976 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-17 02:40:47,978 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-17 02:40:50,049 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-17 02:40:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:40:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:40:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 02:40:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-17 02:40:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-17 02:40:53,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-17 02:40:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 02:40:53,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 02:40:53,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 02:40:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash 704200222, now seen corresponding path program 4 times [2024-10-17 02:40:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 02:40:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303522063] [2024-10-17 02:40:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 02:40:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 02:40:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 02:40:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 22 proven. 121 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 02:40:53,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 02:40:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303522063] [2024-10-17 02:40:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303522063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 02:40:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484445615] [2024-10-17 02:40:53,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 02:40:53,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 02:40:53,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 02:40:53,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 02:40:53,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 02:40:54,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 02:40:54,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 02:40:54,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-17 02:40:54,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 02:40:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-17 02:40:55,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 02:40:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-17 02:40:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484445615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 02:40:57,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 02:40:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 27] total 60 [2024-10-17 02:40:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770471617] [2024-10-17 02:40:57,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 02:40:57,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-17 02:40:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 02:40:57,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-17 02:40:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=2899, Unknown=0, NotChecked=0, Total=3540 [2024-10-17 02:40:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:40:57,099 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 02:40:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 0 states have call successors, (0), 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-17 02:40:57,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 02:40:57,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 02:40:57,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 02:40:57,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-10-17 02:40:57,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-17 02:40:57,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 02:41:06,651 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 124 DAG size of output: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:41:14,096 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 136 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:41:16,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse4 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 33) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse44 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse39 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse43 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse47 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse50 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse42 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse0 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse49 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse51 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296)) (.cse37 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse53 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse48 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse52 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse45 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse23 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse54 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (let ((.cse9 (< 4294967294 .cse54)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 11) 4294967296)) (.cse10 (< 0 .cse23)) (.cse17 (+ 2 .cse45)) (.cse28 (mod (+ 4294967294 c_~n~0) 4294967296)) (.cse30 (< .cse52 (mod c_~n~0 4294967296))) (.cse21 (< 4294967294 .cse48)) (.cse34 (< 4294967294 .cse53)) (.cse11 (< 0 .cse37)) (.cse24 (+ 2 .cse51)) (.cse26 (+ 2 .cse54)) (.cse3 (+ .cse53 2)) (.cse27 (+ 2 .cse49)) (.cse20 (< 0 .cse0)) (.cse33 (< 0 .cse42)) (.cse13 (< 4294967294 .cse50)) (.cse31 (< 0 .cse52)) (.cse16 (< 4294967294 .cse51)) (.cse38 (< 4294967294 .cse47)) (.cse15 (< 0 .cse43)) (.cse29 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) (.cse12 (< 0 .cse39)) (.cse14 (< 4294967294 .cse44)) (.cse5 (+ 2 .cse50)) (.cse18 (< 0 .cse25)) (.cse36 (< 4294967294 .cse49)) (.cse1 (+ .cse48 2)) (.cse7 (+ 2 .cse46)) (.cse41 (+ 2 .cse47)) (.cse35 (< 0 .cse4)) (.cse8 (< 4294967294 .cse46)) (.cse19 (< 4294967294 .cse45)) (.cse32 (< 0 .cse22)) (.cse40 (+ .cse44 2)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse4 .cse5) (<= .cse6 .cse7) (or (< 0 .cse2) .cse8) (or .cse9 .cse10) (or .cse9 .cse11) (or .cse12 .cse13) (<= .cse6 35) (or .cse14 .cse15) (or .cse10 .cse16) (<= .cse0 .cse17) (or .cse18 .cse19) (or .cse20 .cse21) (<= .cse22 .cse17) (<= .cse23 .cse24) (<= .cse25 .cse26) (<= .cse25 .cse27) (or (< .cse28 (+ .cse29 1)) .cse30) (or (< .cse28 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)) .cse30) (or (< 4294967294 .cse29) .cse31) (or .cse21 .cse32) (or .cse33 .cse34) (or .cse35 .cse34) (or .cse11 .cse36) (<= .cse37 .cse24) (<= .cse37 .cse26) (<= .cse4 .cse3) (<= .cse22 .cse27) (or .cse38 .cse20) (<= .cse39 .cse40) (or .cse33 .cse13) (or .cse31 .cse16) (<= .cse39 .cse41) (or .cse38 .cse15) (<= .cse23 (+ 2 .cse29)) (or .cse12 .cse14) (<= .cse42 .cse5) (or .cse18 .cse36) (<= .cse43 .cse1) (<= .cse2 .cse7) (<= .cse43 .cse41) (or .cse35 .cse8) (or .cse19 .cse32) (<= .cse42 .cse40) (<= 1 .cse2)))) is different from false [2024-10-17 02:41:18,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse4 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse44 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 33) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse42 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse37 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse41 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse45 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse48 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse40 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse0 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse47 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse49 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296)) (.cse35 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse50 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse43 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse23 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse51 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (let ((.cse9 (< 4294967294 .cse51)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 11) 4294967296)) (.cse10 (< 0 .cse23)) (.cse17 (+ 2 .cse43)) (.cse21 (< 4294967294 .cse46)) (.cse32 (< 4294967294 .cse50)) (.cse11 (< 0 .cse35)) (.cse24 (+ 2 .cse49)) (.cse26 (+ 2 .cse51)) (.cse3 (+ .cse50 2)) (.cse27 (+ 2 .cse47)) (.cse20 (< 0 .cse0)) (.cse31 (< 0 .cse40)) (.cse13 (< 4294967294 .cse48)) (.cse29 (< 0 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (.cse16 (< 4294967294 .cse49)) (.cse36 (< 4294967294 .cse45)) (.cse15 (< 0 .cse41)) (.cse28 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) (.cse12 (< 0 .cse37)) (.cse14 (< 4294967294 .cse42)) (.cse5 (+ 2 .cse48)) (.cse18 (< 0 .cse25)) (.cse34 (< 4294967294 .cse47)) (.cse1 (+ .cse46 2)) (.cse7 (+ 2 .cse44)) (.cse39 (+ 2 .cse45)) (.cse33 (< 0 .cse4)) (.cse8 (< 4294967294 .cse44)) (.cse19 (< 4294967294 .cse43)) (.cse30 (< 0 .cse22)) (.cse38 (+ .cse42 2)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse4 .cse5) (<= .cse6 .cse7) (or (< 0 .cse2) .cse8) (or .cse9 .cse10) (or .cse9 .cse11) (or .cse12 .cse13) (<= .cse6 35) (or .cse14 .cse15) (or .cse10 .cse16) (<= .cse0 .cse17) (or .cse18 .cse19) (or .cse20 .cse21) (<= .cse22 .cse17) (<= .cse23 .cse24) (<= .cse25 .cse26) (<= .cse25 .cse27) (<= (mod (+ 4294967294 c_~n~0) 4294967296) (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (or (< 4294967294 .cse28) .cse29) (or .cse21 .cse30) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork0_~i~0#1|) (+ c_~n~0 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (or .cse31 .cse32) (or .cse33 .cse32) (or .cse11 .cse34) (<= .cse35 .cse24) (<= .cse35 .cse26) (<= .cse4 .cse3) (<= .cse22 .cse27) (or .cse36 .cse20) (<= .cse37 .cse38) (or .cse31 .cse13) (or .cse29 .cse16) (<= .cse37 .cse39) (or .cse36 .cse15) (<= .cse23 (+ 2 .cse28)) (or .cse12 .cse14) (<= .cse40 .cse5) (or .cse18 .cse34) (<= .cse41 .cse1) (<= .cse2 .cse7) (<= .cse41 .cse39) (or .cse33 .cse8) (or .cse19 .cse30) (<= .cse40 .cse38) (<= 1 .cse2)))) is different from false [2024-10-17 02:41:20,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse4 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse44 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 33) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse42 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse37 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse41 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse45 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse48 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse40 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse0 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse47 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse49 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296)) (.cse35 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse50 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse43 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse23 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse51 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (let ((.cse9 (< 4294967294 .cse51)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 11) 4294967296)) (.cse10 (< 0 .cse23)) (.cse17 (+ 2 .cse43)) (.cse21 (< 4294967294 .cse46)) (.cse32 (< 4294967294 .cse50)) (.cse11 (< 0 .cse35)) (.cse24 (+ 2 .cse49)) (.cse26 (+ 2 .cse51)) (.cse3 (+ .cse50 2)) (.cse27 (+ 2 .cse47)) (.cse20 (< 0 .cse0)) (.cse31 (< 0 .cse40)) (.cse13 (< 4294967294 .cse48)) (.cse29 (< 0 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (.cse16 (< 4294967294 .cse49)) (.cse36 (< 4294967294 .cse45)) (.cse15 (< 0 .cse41)) (.cse28 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) (.cse12 (< 0 .cse37)) (.cse14 (< 4294967294 .cse42)) (.cse5 (+ 2 .cse48)) (.cse18 (< 0 .cse25)) (.cse34 (< 4294967294 .cse47)) (.cse1 (+ .cse46 2)) (.cse7 (+ 2 .cse44)) (.cse39 (+ 2 .cse45)) (.cse33 (< 0 .cse4)) (.cse8 (< 4294967294 .cse44)) (.cse19 (< 4294967294 .cse43)) (.cse30 (< 0 .cse22)) (.cse38 (+ .cse42 2)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse4 .cse5) (<= .cse6 .cse7) (or (< 0 .cse2) .cse8) (or .cse9 .cse10) (or .cse9 .cse11) (or .cse12 .cse13) (<= .cse6 35) (or .cse14 .cse15) (or .cse10 .cse16) (<= .cse0 .cse17) (or .cse18 .cse19) (or .cse20 .cse21) (<= .cse22 .cse17) (<= .cse23 .cse24) (<= .cse25 .cse26) (<= .cse25 .cse27) (or (< 4294967294 .cse28) .cse29) (or .cse21 .cse30) (or .cse31 .cse32) (or .cse33 .cse32) (or .cse11 .cse34) (<= .cse35 .cse24) (<= .cse35 .cse26) (<= .cse4 .cse3) (<= .cse22 .cse27) (or .cse36 .cse20) (<= .cse37 .cse38) (or .cse31 .cse13) (or .cse29 .cse16) (<= .cse37 .cse39) (or .cse36 .cse15) (<= .cse23 (+ 2 .cse28)) (or .cse12 .cse14) (<= .cse40 .cse5) (or .cse18 .cse34) (<= .cse41 .cse1) (<= .cse2 .cse7) (<= .cse41 .cse39) (or .cse33 .cse8) (or .cse19 .cse30) (<= .cse40 .cse38) (<= 1 .cse2)))) is different from false [2024-10-17 02:41:22,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse4 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 33) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse44 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse39 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse43 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse47 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse30 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse50 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse42 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse0 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse49 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse51 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296)) (.cse37 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse52 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse48 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse45 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse23 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse53 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (let ((.cse9 (< 4294967294 .cse53)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 11) 4294967296)) (.cse10 (< 0 .cse23)) (.cse17 (+ 2 .cse45)) (.cse28 (mod (+ 4294967294 c_~n~0) 4294967296)) (.cse21 (< 4294967294 .cse48)) (.cse34 (< 4294967294 .cse52)) (.cse11 (< 0 .cse37)) (.cse24 (+ 2 .cse51)) (.cse26 (+ 2 .cse53)) (.cse3 (+ .cse52 2)) (.cse27 (+ 2 .cse49)) (.cse20 (< 0 .cse0)) (.cse33 (< 0 .cse42)) (.cse13 (< 4294967294 .cse50)) (.cse31 (< 0 .cse30)) (.cse16 (< 4294967294 .cse51)) (.cse38 (< 4294967294 .cse47)) (.cse15 (< 0 .cse43)) (.cse29 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) (.cse12 (< 0 .cse39)) (.cse14 (< 4294967294 .cse44)) (.cse5 (+ 2 .cse50)) (.cse18 (< 0 .cse25)) (.cse36 (< 4294967294 .cse49)) (.cse1 (+ .cse48 2)) (.cse7 (+ 2 .cse46)) (.cse41 (+ 2 .cse47)) (.cse35 (< 0 .cse4)) (.cse8 (< 4294967294 .cse46)) (.cse19 (< 4294967294 .cse45)) (.cse32 (< 0 .cse22)) (.cse40 (+ .cse44 2)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse4 .cse5) (<= .cse6 .cse7) (or (< 0 .cse2) .cse8) (or .cse9 .cse10) (or .cse9 .cse11) (or .cse12 .cse13) (<= .cse6 35) (or .cse14 .cse15) (or .cse10 .cse16) (<= .cse0 .cse17) (or .cse18 .cse19) (or .cse20 .cse21) (<= .cse22 .cse17) (<= .cse23 .cse24) (<= .cse25 .cse26) (<= .cse25 .cse27) (or (< .cse28 (+ .cse29 1)) (< .cse30 (mod c_~n~0 4294967296))) (<= .cse28 (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (or (< 4294967294 .cse29) .cse31) (or .cse21 .cse32) (or .cse33 .cse34) (or .cse35 .cse34) (or .cse11 .cse36) (<= .cse37 .cse24) (<= .cse37 .cse26) (<= .cse4 .cse3) (<= .cse22 .cse27) (or .cse38 .cse20) (<= .cse39 .cse40) (or .cse33 .cse13) (or .cse31 .cse16) (<= .cse39 .cse41) (or .cse38 .cse15) (<= .cse23 (+ 2 .cse29)) (or .cse12 .cse14) (<= .cse42 .cse5) (or .cse18 .cse36) (<= .cse43 .cse1) (<= .cse2 .cse7) (<= .cse43 .cse41) (or .cse35 .cse8) (or .cse19 .cse32) (<= .cse42 .cse40) (<= 1 .cse2)))) is different from false [2024-10-17 02:41:24,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse4 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse44 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 33) 4294967296)) (.cse25 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse42 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse37 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse41 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse45 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse48 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse40 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse0 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse47 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse49 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296)) (.cse35 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse50 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse46 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse43 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse23 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse51 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (let ((.cse9 (< 4294967294 .cse51)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 11) 4294967296)) (.cse10 (< 0 .cse23)) (.cse17 (+ 2 .cse43)) (.cse21 (< 4294967294 .cse46)) (.cse32 (< 4294967294 .cse50)) (.cse11 (< 0 .cse35)) (.cse24 (+ 2 .cse49)) (.cse26 (+ 2 .cse51)) (.cse3 (+ .cse50 2)) (.cse27 (+ 2 .cse47)) (.cse20 (< 0 .cse0)) (.cse31 (< 0 .cse40)) (.cse13 (< 4294967294 .cse48)) (.cse29 (< 0 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (.cse16 (< 4294967294 .cse49)) (.cse36 (< 4294967294 .cse45)) (.cse15 (< 0 .cse41)) (.cse28 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) (.cse12 (< 0 .cse37)) (.cse14 (< 4294967294 .cse42)) (.cse5 (+ 2 .cse48)) (.cse18 (< 0 .cse25)) (.cse34 (< 4294967294 .cse47)) (.cse1 (+ .cse46 2)) (.cse7 (+ 2 .cse44)) (.cse39 (+ 2 .cse45)) (.cse33 (< 0 .cse4)) (.cse8 (< 4294967294 .cse44)) (.cse19 (< 4294967294 .cse43)) (.cse30 (< 0 .cse22)) (.cse38 (+ .cse42 2)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse4 .cse5) (<= .cse6 .cse7) (or (< 0 .cse2) .cse8) (or .cse9 .cse10) (or .cse9 .cse11) (or .cse12 .cse13) (<= .cse6 35) (or .cse14 .cse15) (or .cse10 .cse16) (<= .cse0 .cse17) (or .cse18 .cse19) (or .cse20 .cse21) (<= .cse22 .cse17) (<= .cse23 .cse24) (<= .cse25 .cse26) (<= .cse25 .cse27) (or (< 4294967294 .cse28) .cse29) (or .cse21 .cse30) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork0_~i~0#1|) (+ c_~n~0 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (or .cse31 .cse32) (or .cse33 .cse32) (or .cse11 .cse34) (<= .cse35 .cse24) (<= .cse35 .cse26) (<= .cse4 .cse3) (<= .cse22 .cse27) (or .cse36 .cse20) (<= .cse37 .cse38) (or .cse31 .cse13) (or .cse29 .cse16) (<= .cse37 .cse39) (or .cse36 .cse15) (<= .cse23 (+ 2 .cse28)) (or .cse12 .cse14) (<= .cse40 .cse5) (or .cse18 .cse34) (<= .cse41 .cse1) (<= .cse2 .cse7) (<= .cse41 .cse39) (or .cse33 .cse8) (or .cse19 .cse30) (<= .cse40 .cse38) (<= 1 .cse2)))) is different from false [2024-10-17 02:41:42,566 WARN L286 SmtUtils]: Spent 15.56s on a formula simplification. DAG size of input: 160 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:41:59,782 WARN L286 SmtUtils]: Spent 15.74s on a formula simplification. DAG size of input: 163 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:42:19,323 WARN L286 SmtUtils]: Spent 18.15s on a formula simplification. DAG size of input: 160 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:42:40,155 WARN L286 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 163 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:42:56,868 WARN L286 SmtUtils]: Spent 16.09s on a formula simplification. DAG size of input: 160 DAG size of output: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:43:15,485 WARN L286 SmtUtils]: Spent 17.97s on a formula simplification. DAG size of input: 160 DAG size of output: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:43:37,636 WARN L286 SmtUtils]: Spent 20.57s on a formula simplification. DAG size of input: 163 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:43:55,284 WARN L286 SmtUtils]: Spent 16.20s on a formula simplification. DAG size of input: 160 DAG size of output: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:44:13,826 WARN L286 SmtUtils]: Spent 17.76s on a formula simplification. DAG size of input: 163 DAG size of output: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:44:32,788 WARN L286 SmtUtils]: Spent 18.13s on a formula simplification. DAG size of input: 160 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:44:53,806 WARN L286 SmtUtils]: Spent 19.68s on a formula simplification. DAG size of input: 163 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:45:43,422 WARN L286 SmtUtils]: Spent 41.23s on a formula simplification. DAG size of input: 169 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:46:02,200 WARN L286 SmtUtils]: Spent 18.04s on a formula simplification. DAG size of input: 163 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:46:52,325 WARN L286 SmtUtils]: Spent 42.00s on a formula simplification. DAG size of input: 172 DAG size of output: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:48:16,553 WARN L286 SmtUtils]: Spent 50.87s on a formula simplification. DAG size of input: 125 DAG size of output: 109 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:48:18,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse3 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse1 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse0 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse4 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse16 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse5 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) (.cse15 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse10 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse17 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse12 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse14 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296))) (and (<= (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296) (+ .cse0 2)) (<= .cse1 (+ 2 .cse2)) (or (< 4294967294 .cse3) (< 0 .cse4)) (or (< 0 .cse5) (< 4294967294 .cse6)) (<= .cse7 (+ 2 .cse8)) (or (< 0 .cse7) (< 4294967294 .cse9)) (<= .cse10 (+ 2 .cse3)) (or (< 4294967294 .cse11) (< 0 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork0_~i~0#1|) (+ c_~n~0 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (or (< 0 .cse1) (< 4294967294 .cse0)) (<= .cse4 (+ 2 .cse6)) (<= .cse12 (+ 2 .cse13)) (or (< 0 .cse14) (< 4294967294 .cse2)) (<= .cse15 (+ 2 .cse16)) (or (< 4294967294 .cse16) (< 0 .cse17)) (<= .cse5 (+ 2 .cse11)) (or (< 0 .cse15) (< 4294967294 .cse18)) (or (< 0 .cse10) (< 4294967294 .cse13)) (<= .cse17 (+ .cse9 2)) (or (< 4294967294 .cse8) (< 0 .cse12)) (<= .cse14 (+ .cse18 2)))) is different from false [2024-10-17 02:49:45,081 WARN L286 SmtUtils]: Spent 41.64s on a formula simplification. DAG size of input: 114 DAG size of output: 100 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 02:49:47,087 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-17 02:49:49,818 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-17 02:49:51,821 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-17 02:49:53,825 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-17 02:49:55,827 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-17 02:49:57,828 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-17 02:49:59,830 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-17 02:50:02,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 [] [2024-10-17 02:50:04,107 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-17 02:50:06,109 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-17 02:50:08,110 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-17 02:50:10,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-17 02:50:12,114 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-17 02:50:14,790 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-17 02:50:16,791 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-17 02:50:18,793 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-17 02:50:20,797 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-17 02:50:23,696 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-17 02:50:25,698 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-17 02:50:27,700 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-17 02:50:29,830 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-17 02:50:31,831 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-17 02:50:33,833 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-17 02:50:35,834 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-17 02:50:37,836 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-17 02:50:39,841 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 [] Killed by 15