./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 NONE -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 NONE -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-16 23:03:46,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 23:03:46,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 23:03:46,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 23:03:46,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 23:03:46,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 23:03:46,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 23:03:46,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 23:03:46,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 23:03:46,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 23:03:46,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 23:03:46,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 23:03:46,341 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 23:03:46,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 23:03:46,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 23:03:46,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 23:03:46,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 23:03:46,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 23:03:46,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 23:03:46,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 23:03:46,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 23:03:46,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 23:03:46,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 23:03:46,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 23:03:46,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 23:03:46,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 23:03:46,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 23:03:46,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 23:03:46,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 23:03:46,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 23:03:46,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 23:03:46,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 23:03:46,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 23:03:46,351 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 23:03:46,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 23:03:46,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 23:03:46,351 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 23:03:46,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 23:03:46,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 23:03:46,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 23:03:46,353 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 23:03:46,353 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 -> NONE [2024-10-16 23:03:46,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 23:03:46,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 23:03:46,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 23:03:46,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 23:03:46,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 23:03:46,635 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-16 23:03:48,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 23:03:48,316 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 23:03:48,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2024-10-16 23:03:48,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9df887075/44e3c09ee3dc4d9286b331cc5cc3738f/FLAG9ab851fb1 [2024-10-16 23:03:48,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9df887075/44e3c09ee3dc4d9286b331cc5cc3738f [2024-10-16 23:03:48,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 23:03:48,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 23:03:48,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 23:03:48,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 23:03:48,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 23:03:48,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796183f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48, skipping insertion in model container [2024-10-16 23:03:48,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 23:03:48,595 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-16 23:03:48,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 23:03:48,622 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 23:03:48,650 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-16 23:03:48,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 23:03:48,679 INFO L204 MainTranslator]: Completed translation [2024-10-16 23:03:48,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48 WrapperNode [2024-10-16 23:03:48,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 23:03:48,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 23:03:48,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 23:03:48,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 23:03:48,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,717 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 155 [2024-10-16 23:03:48,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 23:03:48,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 23:03:48,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 23:03:48,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 23:03:48,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 23:03:48,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 23:03:48,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 23:03:48,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 23:03:48,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (1/1) ... [2024-10-16 23:03:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 23:03:48,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:03:48,801 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-16 23:03:48,804 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-16 23:03:48,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 23:03:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-16 23:03:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-16 23:03:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-16 23:03:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-16 23:03:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 23:03:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-16 23:03:48,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-16 23:03:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 23:03:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 23:03:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-16 23:03:48,845 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 23:03:48,935 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 23:03:48,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 23:03:49,260 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 23:03:49,261 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 23:03:49,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 23:03:49,527 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-16 23:03:49,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:03:49 BoogieIcfgContainer [2024-10-16 23:03:49,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 23:03:49,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 23:03:49,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 23:03:49,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 23:03:49,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:03:48" (1/3) ... [2024-10-16 23:03:49,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:03:49, skipping insertion in model container [2024-10-16 23:03:49,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:03:48" (2/3) ... [2024-10-16 23:03:49,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:03:49, skipping insertion in model container [2024-10-16 23:03:49,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:03:49" (3/3) ... [2024-10-16 23:03:49,539 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2024-10-16 23:03:49,557 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 23:03:49,557 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-16 23:03:49,557 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 23:03:49,615 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-16 23:03:49,660 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:03:49,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:03:49,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:03:49,664 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-16 23:03:49,667 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-16 23:03:49,752 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:03:49,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 23:03:49,768 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;@2dddfda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:03:49,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-16 23:03:50,143 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-16 23:03:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:03:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1385037369, now seen corresponding path program 1 times [2024-10-16 23:03:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:03:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966580086] [2024-10-16 23:03:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:03:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:03:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:03:50,575 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-16 23:03:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:03:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966580086] [2024-10-16 23:03:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966580086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:03:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:03:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 23:03:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520637567] [2024-10-16 23:03:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:03:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 23:03:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:03:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 23:03:50,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 23:03:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:03:50,610 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:03:50,611 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-16 23:03:50,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:03:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:03:50,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-16 23:03:50,668 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-16 23:03:50,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:03:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1522111068, now seen corresponding path program 1 times [2024-10-16 23:03:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:03:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362235253] [2024-10-16 23:03:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:03:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:03:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:03:51,064 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-16 23:03:51,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:03:51,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362235253] [2024-10-16 23:03:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362235253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:03:51,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477473185] [2024-10-16 23:03:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:03:51,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:03:51,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:03:51,091 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-16 23:03:51,093 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-16 23:03:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:03:51,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-16 23:03:51,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:03:51,256 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-16 23:03:51,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:03:51,600 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-16 23:03:51,850 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-16 23:03:51,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:03:53,469 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-16 23:03:53,480 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-16 23:03:53,481 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-16 23:03:53,517 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-16 23:03:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477473185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:03:53,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:03:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2024-10-16 23:03:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385275425] [2024-10-16 23:03:53,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:03:53,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-16 23:03:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:03:53,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-16 23:03:53,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-16 23:03:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:03:53,525 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:03:53,525 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-16 23:03:53,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:03:53,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:03:55,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:03:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:03:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:03:55,726 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-16 23:03:55,909 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-16 23:03:55,910 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-16 23:03:55,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:03:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash -321312551, now seen corresponding path program 1 times [2024-10-16 23:03:55,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:03:55,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101651656] [2024-10-16 23:03:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:03:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:03:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:03:56,253 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-16 23:03:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:03:56,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101651656] [2024-10-16 23:03:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101651656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:03:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268787296] [2024-10-16 23:03:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:03:56,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:03:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:03:56,257 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-16 23:03:56,259 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-16 23:03:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:03:56,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-16 23:03:56,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:03:56,395 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-16 23:03:56,749 INFO L349 Elim1Store]: treesize reduction 74, result has 14.9 percent of original size [2024-10-16 23:03:56,750 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-16 23:03:56,850 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-16 23:03:56,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:03:57,821 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-16 23:03:58,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:03:58,278 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-16 23:06:18,433 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-16 23:06:18,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268787296] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:06:18,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:06:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2024-10-16 23:06:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770352008] [2024-10-16 23:06:18,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:06:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-16 23:06:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:06:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-16 23:06:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-16 23:06:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:06:18,436 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:06:18,437 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-16 23:06:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:06:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:06:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:06:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:06:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:06:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:06:19,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-16 23:06:19,349 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-16 23:06:19,350 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-16 23:06:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:06:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1425241175, now seen corresponding path program 2 times [2024-10-16 23:06:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:06:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928172364] [2024-10-16 23:06:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:06:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:06:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:06:20,128 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-16 23:06:20,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:06:20,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928172364] [2024-10-16 23:06:20,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928172364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:06:20,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250804952] [2024-10-16 23:06:20,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 23:06:20,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:06:20,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:06:20,131 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-16 23:06:20,131 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-16 23:06:20,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-16 23:06:20,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:06:20,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-16 23:06:20,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:06:20,287 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-16 23:06:20,325 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-16 23:06:20,967 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-16 23:06:20,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:06:25,171 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-16 23:06:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250804952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:06:25,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:06:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 33 [2024-10-16 23:06:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21566414] [2024-10-16 23:06:25,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:06:25,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-16 23:06:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:06:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-16 23:06:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2024-10-16 23:06:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:06:25,174 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:06:25,174 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-16 23:06:25,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:06:25,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:06:25,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:06:25,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:06:50,150 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-16 23:06:52,168 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-16 23:07:00,835 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-16 23:07:02,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:07:11,271 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 192 DAG size of output: 188 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:07:14,264 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-16 23:07:16,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:07:18,116 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-16 23:07:27,554 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-16 23:07:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:07:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:07:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:07:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-16 23:07:29,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-16 23:07:29,259 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-16 23:07:29,259 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-16 23:07:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:07:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1082673069, now seen corresponding path program 3 times [2024-10-16 23:07:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:07:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731191997] [2024-10-16 23:07:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:07:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:07:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:07:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-16 23:07:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:07:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731191997] [2024-10-16 23:07:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731191997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:07:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453052514] [2024-10-16 23:07:29,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-16 23:07:29,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:07:29,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:07:29,957 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-16 23:07:29,957 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-16 23:07:30,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-16 23:07:30,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:07:30,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-16 23:07:30,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:07:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-16 23:07:30,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:07:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-16 23:07:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453052514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:07:31,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:07:31,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2024-10-16 23:07:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058000969] [2024-10-16 23:07:31,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:07:31,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-16 23:07:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:07:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-16 23:07:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-10-16 23:07:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:07:31,064 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:07:31,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 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-16 23:07:31,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:07:31,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:07:31,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:07:31,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-10-16 23:07:31,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:07:51,858 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 71 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:07:53,864 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-16 23:08:05,040 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 42 DAG size of output: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:08:11,822 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:08:13,829 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-16 23:08:16,486 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-16 23:08:19,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:08:29,542 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-16 23:08:30,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:08:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:08:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:08:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:08:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-16 23:08:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-16 23:08:30,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-16 23:08:30,871 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-16 23:08:30,872 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-16 23:08:30,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:08:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash -477802615, now seen corresponding path program 4 times [2024-10-16 23:08:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:08:30,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14330861] [2024-10-16 23:08:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:08:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:08:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:08:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-16 23:08:32,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:08:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14330861] [2024-10-16 23:08:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14330861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:08:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769717912] [2024-10-16 23:08:32,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-16 23:08:32,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:08:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:08:32,257 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-16 23:08:32,258 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-16 23:08:32,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-16 23:08:32,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:08:32,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-16 23:08:32,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:08:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-16 23:08:33,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:08:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-16 23:08:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769717912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:08:35,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:08:35,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 56 [2024-10-16 23:08:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806196587] [2024-10-16 23:08:35,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:08:35,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-16 23:08:35,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:08:35,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-16 23:08:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=2483, Unknown=0, NotChecked=0, Total=3080 [2024-10-16 23:08:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:08:35,411 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:08:35,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 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-16 23:08:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 23:08:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:08:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:08:35,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-10-16 23:08:35,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-16 23:08:35,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:08:42,007 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 112 DAG size of output: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:08:48,597 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 130 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:10:10,058 WARN L286 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 149 DAG size of output: 110 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:11:57,576 WARN L286 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 150 DAG size of output: 110 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:13:21,516 WARN L286 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 136 DAG size of output: 96 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:13:33,811 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-16 23:13:35,815 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-16 23:13:37,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:13:39,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-16 23:13:42,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:13:44,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:13:46,690 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-16 23:13:48,980 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse3 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse6 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse11 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 33) 4294967296)) (.cse8 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (.cse12 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse4 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse9 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse14 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse17 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse16 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse0 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (and (or (< 4294967294 .cse0) (< 0 .cse1)) (or (< 0 .cse2) (< 4294967294 .cse3)) (or (< 0 .cse4) (< 4294967294 .cse5)) (<= .cse2 (+ 2 .cse6)) (<= .cse1 (+ .cse7 2)) (<= .cse8 (+ .cse3 2)) (or (< 0 .cse9) (< 4294967294 .cse6)) (<= (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) (+ 2 .cse10)) (<= .cse11 (+ 2 .cse5)) (or (< 0 .cse12) (< 4294967294 .cse13)) (or (< 0 .cse11) (< 4294967294 .cse7)) (or (< 4294967294 .cse10) (< 0 .cse8)) (<= .cse12 (+ 2 .cse14)) (or (< 4294967294 .cse15) (< 0 .cse16)) (or (< (mod (+ 4294967294 c_~n~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (< .cse17 (mod c_~n~0 4294967296))) (<= .cse4 (+ 2 .cse13)) (<= .cse9 (+ .cse15 2)) (or (< 4294967294 .cse14) (< 0 .cse17)) (<= .cse16 (+ 2 .cse0)))) is different from false [2024-10-16 23:15:02,740 WARN L286 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 148 DAG size of output: 108 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:15:04,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:15:07,306 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-16 23:15:09,308 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-16 23:15:10,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:15:13,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:15:15,697 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-16 23:16:17,121 WARN L286 SmtUtils]: Spent 50.46s on a formula simplification. DAG size of input: 130 DAG size of output: 104 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-16 23:16:19,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:16:21,128 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-16 23:16:23,129 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-16 23:16:25,134 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-16 23:16:27,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:16:29,137 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-16 23:16:31,138 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-16 23:16:33,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:16:35,141 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-16 23:16:37,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:16:39,287 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-16 23:16:41,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:16:42,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:16:44,354 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-16 23:16:46,356 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-16 23:16:48,357 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-16 23:16:50,359 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-16 23:16:52,361 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-16 23:16:54,363 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-16 23:16:56,584 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-16 23:16:59,201 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-16 23:17:01,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:17:03,205 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-16 23:17:05,206 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-16 23:17:07,208 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-16 23:17:09,210 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-16 23:17:10,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:17:12,220 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-16 23:17:14,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:17:16,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-16 23:17:18,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse3 (mod (+ 30 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse6 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 27) 4294967296)) (.cse5 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296)) (.cse9 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296)) (.cse10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse4 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse11 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296)) (.cse8 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 24) 4294967296)) (.cse12 (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296)) (.cse15 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse14 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse0 (mod (+ 21 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296))) (and (or (< 4294967294 .cse0) (< 0 .cse1)) (or (< 0 .cse2) (< 4294967294 .cse3)) (or (< 0 .cse4) (< 4294967294 .cse5)) (<= .cse2 (+ 2 .cse6)) (<= .cse1 (+ .cse7 2)) (<= (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296) (+ .cse3 2)) (or (< 0 .cse8) (< 4294967294 .cse6)) (<= .cse9 (+ 2 .cse5)) (or (< 0 .cse10) (< 4294967294 .cse11)) (or (< 0 .cse9) (< 4294967294 .cse7)) (<= .cse10 (+ 2 .cse12)) (or (< 4294967294 .cse13) (< 0 .cse14)) (or (< (mod (+ 4294967294 c_~n~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (< .cse15 (mod c_~n~0 4294967296))) (<= .cse4 (+ 2 .cse11)) (<= .cse8 (+ .cse13 2)) (or (< 4294967294 .cse12) (< 0 .cse15)) (<= .cse14 (+ 2 .cse0)))) is different from false [2024-10-16 23:17:20,513 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