./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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/popl20-mult-4.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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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-19 05:04:30,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 05:04:30,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 05:04:30,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 05:04:30,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 05:04:30,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 05:04:30,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 05:04:30,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 05:04:30,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 05:04:30,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 05:04:30,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 05:04:30,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 05:04:30,551 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 05:04:30,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 05:04:30,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 05:04:30,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 05:04:30,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 05:04:30,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 05:04:30,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 05:04:30,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 05:04:30,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 05:04:30,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 05:04:30,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 05:04:30,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 05:04:30,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 05:04:30,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 05:04:30,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 05:04:30,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 05:04:30,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 05:04:30,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 05:04:30,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:04:30,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 05:04:30,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 05:04:30,562 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 05:04:30,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 05:04:30,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 05:04:30,563 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 05:04:30,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 05:04:30,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 05:04:30,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 05:04:30,564 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 05:04:30,565 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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 05:04:30,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 05:04:30,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 05:04:30,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 05:04:30,867 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 05:04:30,868 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 05:04:30,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-19 05:04:32,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 05:04:32,555 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 05:04:32,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-19 05:04:32,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c889e3525/0d7b81b127df452c84210fcc8d1c03db/FLAG1e03a19b5 [2024-10-19 05:04:32,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c889e3525/0d7b81b127df452c84210fcc8d1c03db [2024-10-19 05:04:32,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 05:04:32,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 05:04:32,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 05:04:32,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 05:04:32,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 05:04:32,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e355a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32, skipping insertion in model container [2024-10-19 05:04:32,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 05:04:32,833 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2024-10-19 05:04:32,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:04:32,854 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 05:04:32,878 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2024-10-19 05:04:32,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:04:32,902 INFO L204 MainTranslator]: Completed translation [2024-10-19 05:04:32,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32 WrapperNode [2024-10-19 05:04:32,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 05:04:32,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 05:04:32,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 05:04:32,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 05:04:32,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,958 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-10-19 05:04:32,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 05:04:32,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 05:04:32,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 05:04:32,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 05:04:32,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:32,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 05:04:32,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 05:04:32,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 05:04:32,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 05:04:33,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (1/1) ... [2024-10-19 05:04:33,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:04:33,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:04:33,031 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-19 05:04:33,032 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-19 05:04:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 05:04:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 05:04:33,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 05:04:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 05:04:33,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 05:04:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-19 05:04:33,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-19 05:04:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-19 05:04:33,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-19 05:04:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 05:04:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 05:04:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 05:04:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 05:04:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 05:04:33,076 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 05:04:33,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 05:04:33,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 05:04:33,396 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 05:04:33,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 05:04:33,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 05:04:33,554 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-19 05:04:33,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:04:33 BoogieIcfgContainer [2024-10-19 05:04:33,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 05:04:33,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 05:04:33,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 05:04:33,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 05:04:33,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 05:04:32" (1/3) ... [2024-10-19 05:04:33,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ab8c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:04:33, skipping insertion in model container [2024-10-19 05:04:33,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:04:32" (2/3) ... [2024-10-19 05:04:33,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ab8c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:04:33, skipping insertion in model container [2024-10-19 05:04:33,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:04:33" (3/3) ... [2024-10-19 05:04:33,569 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-10-19 05:04:33,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 05:04:33,602 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 05:04:33,602 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 05:04:33,688 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 05:04:33,726 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 05:04:33,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 05:04:33,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:04:33,728 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-19 05:04:33,729 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-19 05:04:33,806 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 05:04:33,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:04:33,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 05:04:33,832 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;@203aa2f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 05:04:33,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 05:04:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash -297348609, now seen corresponding path program 1 times [2024-10-19 05:04:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:35,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash -535005413, now seen corresponding path program 1 times [2024-10-19 05:04:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash 594699487, now seen corresponding path program 1 times [2024-10-19 05:04:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:36,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1255813051, now seen corresponding path program 1 times [2024-10-19 05:04:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:36,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -338209895, now seen corresponding path program 1 times [2024-10-19 05:04:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1894573672, now seen corresponding path program 1 times [2024-10-19 05:04:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1397756825, now seen corresponding path program 1 times [2024-10-19 05:04:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:38,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1013534283, now seen corresponding path program 1 times [2024-10-19 05:04:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1354789937, now seen corresponding path program 1 times [2024-10-19 05:04:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash -951186645, now seen corresponding path program 1 times [2024-10-19 05:04:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 170531337, now seen corresponding path program 1 times [2024-10-19 05:04:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:39,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 991502142, now seen corresponding path program 1 times [2024-10-19 05:04:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:40,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:40,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash 671793353, now seen corresponding path program 1 times [2024-10-19 05:04:40,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:40,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:40,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1153961981, now seen corresponding path program 1 times [2024-10-19 05:04:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:40,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash -733212888, now seen corresponding path program 1 times [2024-10-19 05:04:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:41,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:41,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2054558111, now seen corresponding path program 1 times [2024-10-19 05:04:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1413085140, now seen corresponding path program 1 times [2024-10-19 05:04:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:43,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:04:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781247, now seen corresponding path program 1 times [2024-10-19 05:04:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:43,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781463, now seen corresponding path program 1 times [2024-10-19 05:04:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:44,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:04:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:04:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1336305715, now seen corresponding path program 1 times [2024-10-19 05:04:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:44,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 05:04:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:44,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 05:04:44,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 05:04:44,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:04:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash -73013975, now seen corresponding path program 1 times [2024-10-19 05:04:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:04:44,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478736519] [2024-10-19 05:04:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 107 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-19 05:04:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:04:45,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478736519] [2024-10-19 05:04:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478736519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:04:45,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892130221] [2024-10-19 05:04:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:45,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:04:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:04:45,133 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-19 05:04:45,135 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-19 05:04:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:45,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-19 05:04:45,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:04:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-19 05:04:45,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:04:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-19 05:04:46,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892130221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:04:46,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:04:46,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2024-10-19 05:04:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488189462] [2024-10-19 05:04:46,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:04:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-19 05:04:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:04:46,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-19 05:04:46,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-10-19 05:04:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:04:46,180 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:04:46,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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-19 05:04:46,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:04:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 05:04:47,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-19 05:04:47,963 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,SelfDestructingSolverStorable33 [2024-10-19 05:04:47,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 05:04:47,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:04:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2096618437, now seen corresponding path program 2 times [2024-10-19 05:04:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:04:47,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336024573] [2024-10-19 05:04:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:04:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:04:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:04:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 366 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-10-19 05:04:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:04:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336024573] [2024-10-19 05:04:48,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336024573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:04:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458952958] [2024-10-19 05:04:48,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 05:04:48,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:04:48,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:04:48,775 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-19 05:04:48,776 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-19 05:04:48,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 05:04:48,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:04:48,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-19 05:04:48,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:04:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 492 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-19 05:04:49,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:04:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 492 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-19 05:04:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458952958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:04:50,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:04:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2024-10-19 05:04:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700412963] [2024-10-19 05:04:50,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:04:50,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-19 05:04:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:04:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-19 05:04:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2024-10-19 05:04:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:04:50,893 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:04:50,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.617021276595745) internal successors, (311), 47 states have internal predecessors, (311), 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-19 05:04:50,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-19 05:04:50,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:05:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 05:05:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-19 05:05:10,561 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-19 05:05:10,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-19 05:05:10,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 05:05:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:05:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -453510420, now seen corresponding path program 3 times [2024-10-19 05:05:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:05:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288950298] [2024-10-19 05:05:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:05:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:05:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:05:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 553 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2024-10-19 05:05:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:05:12,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288950298] [2024-10-19 05:05:12,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288950298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:05:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569905535] [2024-10-19 05:05:12,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 05:05:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:05:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:05:12,648 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-19 05:05:12,650 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-19 05:05:13,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2024-10-19 05:05:13,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:05:13,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-19 05:05:13,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:05:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 2073 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-19 05:05:14,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:05:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 2073 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-19 05:05:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569905535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:05:16,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:05:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 41, 41] total 83 [2024-10-19 05:05:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315758371] [2024-10-19 05:05:16,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:05:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-10-19 05:05:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:05:16,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-10-19 05:05:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=5557, Unknown=0, NotChecked=0, Total=6806 [2024-10-19 05:05:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:05:16,885 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:05:16,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 6.204819277108434) internal successors, (515), 83 states have internal predecessors, (515), 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-19 05:05:16,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-19 05:05:16,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-10-19 05:05:16,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:05:32,076 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 149 DAG size of output: 149 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:05:38,953 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 155 DAG size of output: 148 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:05:45,377 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-19 05:05:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-19 05:05:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-19 05:05:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-19 05:05:45,672 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-19 05:05:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:05:45,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 05:05:45,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:05:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash -684919156, now seen corresponding path program 4 times [2024-10-19 05:05:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:05:45,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477212438] [2024-10-19 05:05:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:05:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:05:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:05:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 873 proven. 3210 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-19 05:05:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:05:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477212438] [2024-10-19 05:05:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477212438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:05:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585447353] [2024-10-19 05:05:50,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-19 05:05:50,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:05:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:05:50,292 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-19 05:05:50,293 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-19 05:05:50,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-19 05:05:50,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:05:50,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-19 05:05:50,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:05:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 237 proven. 3900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:05:54,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:06:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 237 proven. 3900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:06:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585447353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:06:03,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:06:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 61, 61] total 168 [2024-10-19 05:06:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066393478] [2024-10-19 05:06:03,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:06:03,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2024-10-19 05:06:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:06:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2024-10-19 05:06:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2751, Invalid=25305, Unknown=0, NotChecked=0, Total=28056 [2024-10-19 05:06:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:06:03,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:06:03,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 5.684523809523809) internal successors, (955), 168 states have internal predecessors, (955), 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-19 05:06:03,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-19 05:06:03,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2024-10-19 05:06:03,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-10-19 05:06:03,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:06:32,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 19 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 20) 4294967296) 1)) (.cse10 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse13 (+ (mod (+ 14 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse11 (+ (mod (+ 15 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse5 (+ (mod (+ 23 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse14 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse20 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) 4294967296) 1)) (.cse16 (+ (mod (+ 9 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse3 (+ (mod (+ 19 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse29 (mod (+ c_thread1Thread1of1ForFork0_~i~0 18) 4294967296)) (.cse22 (+ (mod (+ 16 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse25 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse15 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse31 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 12) 4294967296) 1)) (.cse26 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse38 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 26) 4294967296) 1)) (.cse21 (mod (+ 23 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 24) 4294967296) 1)) (.cse9 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 4) 4294967296) 1)) (.cse36 (+ (mod (+ 8 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse35 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 13) 4294967296) 1)) (.cse45 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse34 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 10) 4294967296) 1)) (.cse33 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 17) 4294967296) 1)) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 20) 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse44 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse30 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse46 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 11) 4294967296) 1)) (.cse51 (+ (mod (+ 7 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse4 (mod (+ 22 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse24 (+ (mod (+ 22 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse41 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse50 (+ (mod (+ 5 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse37 (mod (+ c_thread1Thread1of1ForFork0_~i~0 25) 4294967296)) (.cse19 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse52 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse42 (+ (mod (+ 6 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse40 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse43 (+ (mod (+ 3 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse47 (mod (+ c_thread1Thread1of1ForFork0_~i~0 17) 4294967296)) (.cse32 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 18) 4294967296) 1)) (.cse23 (mod (+ 21 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse49 (+ (mod (+ 21 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse17 (mod (+ c_thread1Thread1of1ForFork0_~i~0 27) 4294967296)) (.cse12 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 28) 4294967296) 1)) (.cse39 (mod (+ c_thread1Thread1of1ForFork0_~i~0 26) 4294967296)) (.cse18 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 27) 4294967296) 1)) (.cse27 (mod (+ c_thread1Thread1of1ForFork0_~i~0 24) 4294967296)) (.cse53 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 25) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 .cse3) (< .cse4 .cse5) (< .cse6 .cse7) (< .cse8 .cse9) (< .cse2 .cse1) (< .cse10 .cse11) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 28) 4294967296) .cse12) (< .cse10 .cse13) (< .cse6 .cse13) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse9) (< .cse14 .cse11) (< .cse15 .cse16) (< .cse17 .cse18) (< .cse19 .cse20) (< .cse21 .cse5) (< .cse14 .cse22) (< .cse23 .cse24) (< .cse25 .cse20) (< .cse26 .cse16) (< .cse27 .cse28) (< .cse29 .cse3) (< .cse30 .cse31) (< .cse29 .cse32) (< .cse33 .cse22) (< .cse25 (+ (mod |c_thread2Thread1of1ForFork2_~i~1#1| 4294967296) 1)) (< .cse15 .cse34) (< .cse35 .cse31) (< .cse26 .cse36) (< .cse37 .cse38) (< .cse39 .cse38) (< .cse21 .cse28) (< .cse40 .cse9) (< .cse41 .cse42) (< .cse19 .cse43) (< .cse44 .cse36) (< .cse35 .cse7) (< .cse45 .cse46) (< .cse47 .cse48) (< .cse45 .cse34) (< .cse33 .cse48) (< .cse0 .cse49) (< .cse8 .cse50) (< .cse44 .cse51) (< .cse30 .cse46) (< .cse52 .cse51) (< .cse4 .cse24) (< .cse41 .cse50) (< .cse37 .cse53) (< .cse19 (+ (mod (+ 2 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse52 .cse42) (< .cse40 .cse43) (< .cse47 .cse32) (< .cse23 .cse49) (< .cse17 .cse12) (< .cse39 .cse18) (< .cse27 .cse53))) is different from false [2024-10-19 05:07:39,349 WARN L286 SmtUtils]: Spent 28.26s on a formula simplification. DAG size of input: 152 DAG size of output: 130 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:10:16,070 WARN L286 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 194 DAG size of output: 168 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:10:18,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (< (mod (+ 22 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 23 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 19 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 20) 4294967296) 1)) (< (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 15 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296) (+ (mod (+ 14 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 4) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) 4294967296) 1)) (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 16 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 21 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 22 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 9 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 18) 4294967296) (+ (mod (+ 19 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 12) 4294967296) 1)) (< (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 10) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 25) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 26) 4294967296) 1)) (< (mod (+ 23 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 24) 4294967296) 1)) (< (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 6 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 3 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 8 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 13) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 11) 4294967296) 1)) (< (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 17) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 20) 4294967296) (+ (mod (+ 21 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296) (+ (mod (+ 5 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 7 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 2 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 17) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 18) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 27) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 28) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 26) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 27) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 24) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 25) 4294967296) 1)))) is different from false [2024-10-19 05:12:31,597 WARN L286 SmtUtils]: Spent 53.07s on a formula simplification. DAG size of input: 184 DAG size of output: 158 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:12:34,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:12:36,477 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-19 05:12:41,661 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-19 05:12:43,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:12:47,878 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-19 05:12:50,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:12:52,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:12:54,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:12:56,695 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-19 05:12:58,697 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-19 05:13:00,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:02,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:04,692 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-19 05:13:07,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:09,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:10,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:12,814 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-19 05:13:14,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:15,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:18,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:13:19,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:40,228 WARN L286 SmtUtils]: Spent 55.90s on a formula simplification. DAG size of input: 186 DAG size of output: 160 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:15:42,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:44,346 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-19 05:15:47,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:49,452 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-19 05:15:51,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:52,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:54,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:56,386 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-19 05:15:57,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:15:59,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:00,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:02,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:04,723 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-19 05:16:06,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:07,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:09,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:12,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:15,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:17,804 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-19 05:16:19,805 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-19 05:16:21,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:24,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:26,239 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-19 05:16:27,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:30,572 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-19 05:16:34,532 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-19 05:16:36,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:38,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:41,154 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-19 05:16:42,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:44,405 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-19 05:16:46,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:48,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:16:51,324 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-19 05:16:53,423 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-19 05:16:55,428 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-19 05:16:56,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:00,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:01,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:03,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:04,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:07,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:09,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:11,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:15,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:16,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:18,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:20,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:22,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:24,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:26,777 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-19 05:17:29,395 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-19 05:17:31,397 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-19 05:17:33,399 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-19 05:17:36,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:39,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:42,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:44,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:45,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:47,687 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-19 05:17:49,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:50,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:51,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:53,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:54,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:17:56,852 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-19 05:17:59,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:02,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:03,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:08,042 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-19 05:18:10,045 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-19 05:18:11,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:14,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:15,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:16,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:19,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:20,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:22,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:23,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:25,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:28,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:30,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:32,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:33,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:18:36,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15