./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 IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -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 IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 10:14:11,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 10:14:12,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 10:14:12,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 10:14:12,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 10:14:12,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 10:14:12,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 10:14:12,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 10:14:12,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 10:14:12,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 10:14:12,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 10:14:12,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 10:14:12,084 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 10:14:12,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 10:14:12,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 10:14:12,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 10:14:12,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 10:14:12,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 10:14:12,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 10:14:12,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 10:14:12,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 10:14:12,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 10:14:12,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 10:14:12,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 10:14:12,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 10:14:12,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 10:14:12,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 10:14:12,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 10:14:12,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 10:14:12,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 10:14:12,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 10:14:12,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 10:14:12,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 10:14:12,095 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 10:14:12,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 10:14:12,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 10:14:12,096 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 10:14:12,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 10:14:12,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 10:14:12,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 10:14:12,096 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 10:14:12,097 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-10-18 10:14:12,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 10:14:12,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 10:14:12,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 10:14:12,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 10:14:12,364 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 10:14:12,365 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-18 10:14:13,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 10:14:13,959 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 10:14:13,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-18 10:14:13,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d08439555/65be8d952f2d42ce830d3bc9a68a392b/FLAGa41506567 [2024-10-18 10:14:13,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d08439555/65be8d952f2d42ce830d3bc9a68a392b [2024-10-18 10:14:13,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 10:14:13,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 10:14:13,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 10:14:13,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 10:14:13,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 10:14:13,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 10:14:13" (1/1) ... [2024-10-18 10:14:13,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efcb773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:13, skipping insertion in model container [2024-10-18 10:14:13,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 10:14:13" (1/1) ... [2024-10-18 10:14:14,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 10:14:14,204 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-18 10:14:14,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 10:14:14,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 10:14:14,244 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-18 10:14:14,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 10:14:14,264 INFO L204 MainTranslator]: Completed translation [2024-10-18 10:14:14,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14 WrapperNode [2024-10-18 10:14:14,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 10:14:14,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 10:14:14,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 10:14:14,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 10:14:14,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,313 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-10-18 10:14:14,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 10:14:14,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 10:14:14,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 10:14:14,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 10:14:14,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 10:14:14,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 10:14:14,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 10:14:14,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 10:14:14,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (1/1) ... [2024-10-18 10:14:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 10:14:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 10:14:14,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 10:14:14,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 10:14:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 10:14:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-18 10:14:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-18 10:14:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-18 10:14:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-18 10:14:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-18 10:14:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-18 10:14:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-18 10:14:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-18 10:14:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 10:14:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 10:14:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 10:14:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 10:14:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 10:14:14,445 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 10:14:14,572 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 10:14:14,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 10:14:14,815 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 10:14:14,815 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 10:14:14,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 10:14:14,982 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-18 10:14:14,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 10:14:14 BoogieIcfgContainer [2024-10-18 10:14:14,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 10:14:14,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 10:14:14,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 10:14:14,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 10:14:14,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 10:14:13" (1/3) ... [2024-10-18 10:14:14,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc40577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 10:14:14, skipping insertion in model container [2024-10-18 10:14:14,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 10:14:14" (2/3) ... [2024-10-18 10:14:14,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc40577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 10:14:14, skipping insertion in model container [2024-10-18 10:14:14,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 10:14:14" (3/3) ... [2024-10-18 10:14:14,993 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-10-18 10:14:15,010 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 10:14:15,010 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 10:14:15,011 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 10:14:15,079 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-18 10:14:15,118 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 10:14:15,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 10:14:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 10:14:15,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 10:14:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 10:14:15,203 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 10:14:15,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 10:14:15,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 10:14:15,225 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;@cc39ab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 10:14:15,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-18 10:14:16,464 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-18 10:14:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 10:14:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -73013975, now seen corresponding path program 1 times [2024-10-18 10:14:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 10:14:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5397429] [2024-10-18 10:14:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:17,732 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-18 10:14:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 10:14:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5397429] [2024-10-18 10:14:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5397429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 10:14:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603622445] [2024-10-18 10:14:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:17,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 10:14:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 10:14:17,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 10:14:17,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 10:14:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:17,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-18 10:14:17,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 10:14:18,340 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-18 10:14:18,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 10:14:18,889 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-18 10:14:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603622445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 10:14:18,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 10:14:18,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2024-10-18 10:14:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099075454] [2024-10-18 10:14:18,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 10:14:18,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-18 10:14:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 10:14:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash -297348609, now seen corresponding path program 1 times [2024-10-18 10:14:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:19,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash -535005413, now seen corresponding path program 1 times [2024-10-18 10:14:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:19,488 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-18 10:14:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:19,634 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-18 10:14:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 594699487, now seen corresponding path program 1 times [2024-10-18 10:14:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:19,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1255813051, now seen corresponding path program 1 times [2024-10-18 10:14:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:20,132 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-18 10:14:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:20,332 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-18 10:14:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -338209895, now seen corresponding path program 1 times [2024-10-18 10:14:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:20,543 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-18 10:14:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:20,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:20,715 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-18 10:14:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1894573672, now seen corresponding path program 1 times [2024-10-18 10:14:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:20,915 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-18 10:14:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:21,095 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-18 10:14:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1397756825, now seen corresponding path program 1 times [2024-10-18 10:14:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:21,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1013534283, now seen corresponding path program 1 times [2024-10-18 10:14:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:21,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:21,401 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-18 10:14:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:21,585 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-18 10:14:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1354789937, now seen corresponding path program 1 times [2024-10-18 10:14:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:21,828 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-18 10:14:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:22,004 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-18 10:14:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -951186645, now seen corresponding path program 1 times [2024-10-18 10:14:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:22,462 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-18 10:14:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:22,748 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-18 10:14:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 170531337, now seen corresponding path program 1 times [2024-10-18 10:14:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:22,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash 991502142, now seen corresponding path program 1 times [2024-10-18 10:14:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:23,132 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-18 10:14:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:23,330 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-18 10:14:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 671793353, now seen corresponding path program 1 times [2024-10-18 10:14:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1348254632, now seen corresponding path program 1 times [2024-10-18 10:14:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781467, now seen corresponding path program 1 times [2024-10-18 10:14:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781466, now seen corresponding path program 1 times [2024-10-18 10:14:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1407489175, now seen corresponding path program 1 times [2024-10-18 10:14:23,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:23,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1407489174, now seen corresponding path program 1 times [2024-10-18 10:14:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -682493436, now seen corresponding path program 1 times [2024-10-18 10:14:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 317537963, now seen corresponding path program 1 times [2024-10-18 10:14:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:25,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 10:14:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1022930791, now seen corresponding path program 1 times [2024-10-18 10:14:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:25,923 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-18 10:14:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:26,166 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-18 10:14:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1022930792, now seen corresponding path program 1 times [2024-10-18 10:14:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:26,425 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-18 10:14:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:26,618 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-18 10:14:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1336305718, now seen corresponding path program 1 times [2024-10-18 10:14:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:26,882 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-18 10:14:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:27,081 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-18 10:14:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1336305719, now seen corresponding path program 1 times [2024-10-18 10:14:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:27,314 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-18 10:14:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:27,554 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-18 10:14:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1524197760, now seen corresponding path program 1 times [2024-10-18 10:14:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:27,789 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-18 10:14:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:27,993 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-18 10:14:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1524197759, now seen corresponding path program 1 times [2024-10-18 10:14:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:28,323 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-18 10:14:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:28,594 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-18 10:14:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -5492360, now seen corresponding path program 1 times [2024-10-18 10:14:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:28,881 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-18 10:14:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:29,086 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-18 10:14:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash -5492359, now seen corresponding path program 1 times [2024-10-18 10:14:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:29,341 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-18 10:14:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:29,543 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-18 10:14:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -170265741, now seen corresponding path program 1 times [2024-10-18 10:14:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:29,768 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-18 10:14:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:29,974 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-18 10:14:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -983273286, now seen corresponding path program 1 times [2024-10-18 10:14:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:30,238 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-18 10:14:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:30,450 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-18 10:14:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-18 10:14:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2024-10-18 10:14:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:14:30,488 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 10:14:30,489 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-18 10:14:30,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:14:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-18 10:14:32,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-18 10:14:32,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable0,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-18 10:14:32,248 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-18 10:14:32,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 10:14:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2096618437, now seen corresponding path program 2 times [2024-10-18 10:14:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 10:14:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344670710] [2024-10-18 10:14:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:32,867 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-18 10:14:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 10:14:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344670710] [2024-10-18 10:14:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344670710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 10:14:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63559032] [2024-10-18 10:14:32,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 10:14:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 10:14:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 10:14:32,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 10:14:32,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-18 10:14:32,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 10:14:32,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 10:14:33,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-18 10:14:33,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 10:14:33,722 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-18 10:14:33,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 10:14:34,835 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-18 10:14:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63559032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 10:14:34,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 10:14:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2024-10-18 10:14:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509016414] [2024-10-18 10:14:34,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 10:14:34,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-18 10:14:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 10:14:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash 940308564, now seen corresponding path program 1 times [2024-10-18 10:14:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:34,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:14:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:14:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 870814672, now seen corresponding path program 1 times [2024-10-18 10:14:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-18 10:14:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:35,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-18 10:14:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash 550797113, now seen corresponding path program 1 times [2024-10-18 10:14:35,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-18 10:14:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-18 10:14:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1064701355, now seen corresponding path program 1 times [2024-10-18 10:14:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1353993449, now seen corresponding path program 1 times [2024-10-18 10:14:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -975878923, now seen corresponding path program 1 times [2024-10-18 10:14:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1701700397, now seen corresponding path program 1 times [2024-10-18 10:14:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1213107294, now seen corresponding path program 1 times [2024-10-18 10:14:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1048377043, now seen corresponding path program 1 times [2024-10-18 10:14:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:39,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 834594181, now seen corresponding path program 1 times [2024-10-18 10:14:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 102613051, now seen corresponding path program 1 times [2024-10-18 10:14:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1113965467, now seen corresponding path program 1 times [2024-10-18 10:14:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1074045084, now seen corresponding path program 1 times [2024-10-18 10:14:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1064337890, now seen corresponding path program 1 times [2024-10-18 10:14:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:41,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:42,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1064337891, now seen corresponding path program 1 times [2024-10-18 10:14:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1365266619, now seen corresponding path program 1 times [2024-10-18 10:14:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1365266618, now seen corresponding path program 1 times [2024-10-18 10:14:43,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash 626405025, now seen corresponding path program 1 times [2024-10-18 10:14:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2056283481, now seen corresponding path program 1 times [2024-10-18 10:14:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-18 10:14:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1975582151, now seen corresponding path program 1 times [2024-10-18 10:14:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-18 10:14:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:14:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:14:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:14:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 80 proven. 72 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-18 10:14:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-18 10:14:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2061, Unknown=0, NotChecked=0, Total=2352 [2024-10-18 10:14:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:14:45,143 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 10:14:45,143 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-18 10:14:45,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-18 10:14:45,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:15:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-18 10:15:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-18 10:15:03,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-18 10:15:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable70,SelfDestructingSolverStorable92,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable53,SelfDestructingSolverStorable75,SelfDestructingSolverStorable54,SelfDestructingSolverStorable76,SelfDestructingSolverStorable55,SelfDestructingSolverStorable77,SelfDestructingSolverStorable56,SelfDestructingSolverStorable78,SelfDestructingSolverStorable57,SelfDestructingSolverStorable79,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable60,SelfDestructingSolverStorable82,SelfDestructingSolverStorable61,SelfDestructingSolverStorable83,SelfDestructingSolverStorable62,SelfDestructingSolverStorable84,SelfDestructingSolverStorable63,SelfDestructingSolverStorable85,SelfDestructingSolverStorable64,SelfDestructingSolverStorable86,SelfDestructingSolverStorable65,SelfDestructingSolverStorable87,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66,SelfDestructingSolverStorable88,SelfDestructingSolverStorable67,SelfDestructingSolverStorable89,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-10-18 10:15:03,243 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-18 10:15:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 10:15:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -453510420, now seen corresponding path program 3 times [2024-10-18 10:15:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 10:15:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296481819] [2024-10-18 10:15:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:04,349 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-18 10:15:04,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 10:15:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296481819] [2024-10-18 10:15:04,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296481819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 10:15:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226026416] [2024-10-18 10:15:04,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 10:15:04,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 10:15:04,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 10:15:04,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 10:15:04,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-18 10:15:04,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2024-10-18 10:15:04,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 10:15:04,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-18 10:15:04,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 10:15:05,907 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-18 10:15:05,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 10:15:07,704 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-18 10:15:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226026416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 10:15:07,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 10:15:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 41, 41] total 83 [2024-10-18 10:15:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899654963] [2024-10-18 10:15:07,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 10:15:07,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-10-18 10:15:07,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 10:15:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 881249824, now seen corresponding path program 1 times [2024-10-18 10:15:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2024-10-18 10:15:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2024-10-18 10:15:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -711717936, now seen corresponding path program 1 times [2024-10-18 10:15:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 0 proven. 1007 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-18 10:15:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2777 backedges. 0 proven. 1007 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-18 10:15:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 286974437, now seen corresponding path program 1 times [2024-10-18 10:15:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3073 backedges. 0 proven. 1272 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-18 10:15:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3073 backedges. 0 proven. 1272 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-18 10:15:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1134350753, now seen corresponding path program 1 times [2024-10-18 10:15:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:15:15,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:15:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:15:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 805131436, now seen corresponding path program 1 times [2024-10-18 10:15:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 10:15:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 10:15:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash -810732767, now seen corresponding path program 1 times [2024-10-18 10:15:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:15:19,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:15:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:15:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash -85552321, now seen corresponding path program 1 times [2024-10-18 10:15:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 10:15:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2024-10-18 10:15:22,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-10-18 10:15:22,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=6395, Unknown=0, NotChecked=0, Total=7656 [2024-10-18 10:15:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:15:22,417 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 10:15:22,420 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-18 10:15:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-18 10:15:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-10-18 10:15:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:15:43,689 WARN L286 SmtUtils]: Spent 5.26s 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-18 10:15:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-18 10:15:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-18 10:15:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-18 10:15:48,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-18 10:15:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2024-10-18 10:15:48,616 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-18 10:15:48,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 10:15:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -684919156, now seen corresponding path program 4 times [2024-10-18 10:15:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 10:15:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311656470] [2024-10-18 10:15:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:15:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:15:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:15:51,477 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-18 10:15:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 10:15:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311656470] [2024-10-18 10:15:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311656470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 10:15:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17520778] [2024-10-18 10:15:51,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 10:15:51,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 10:15:51,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 10:15:51,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 10:15:51,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-18 10:15:51,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 10:15:51,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 10:15:51,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-18 10:15:51,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 10:15:55,790 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-18 10:15:55,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 10:16:04,592 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-18 10:16:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17520778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 10:16:04,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 10:16:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 61, 61] total 168 [2024-10-18 10:16:04,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678865668] [2024-10-18 10:16:04,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 10:16:04,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2024-10-18 10:16:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 10:16:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1255891012, now seen corresponding path program 1 times [2024-10-18 10:16:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:16:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:16:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:16:05,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 10:16:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 10:16:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash -926806304, now seen corresponding path program 1 times [2024-10-18 10:16:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:16:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:16:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:16:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 0 proven. 1659 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-18 10:16:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:16:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:16:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:16:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 0 proven. 1659 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-18 10:16:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 190806037, now seen corresponding path program 1 times [2024-10-18 10:16:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:16:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:16:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:16:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-18 10:16:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 10:16:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 10:16:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 10:16:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 0 proven. 5586 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-18 10:16:14,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2024-10-18 10:16:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=28376, Unknown=0, NotChecked=0, Total=31152 [2024-10-18 10:16:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:16:14,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 10:16:14,699 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-18 10:16:14,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-18 10:16:14,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2024-10-18 10:16:14,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-10-18 10:16:14,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 10:16:43,328 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-18 10:18:00,850 WARN L286 SmtUtils]: Spent 30.17s 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-18 10:20:49,686 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-18 10:20:51,695 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-18 10:23:06,234 WARN L286 SmtUtils]: Spent 57.85s 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-18 10:23:07,431 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-18 10:23:09,411 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-18 10:23:11,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:14,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:16,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:18,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:20,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:21,476 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-18 10:23:23,231 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-18 10:23:25,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:27,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:32,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:34,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:36,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:38,329 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-18 10:23:41,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:42,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:44,749 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-18 10:23:46,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:23:47,947 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-18 10:23:49,055 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-18 10:26:18,655 WARN L286 SmtUtils]: Spent 1.01m 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-18 10:26:20,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:24,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:26,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:28,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:30,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:32,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:36,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:38,364 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-18 10:26:41,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:43,387 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-18 10:26:45,225 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-18 10:26:48,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:50,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:53,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:54,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:56,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:26:57,614 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-18 10:27:01,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:03,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:05,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:08,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:10,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:11,386 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-18 10:27:13,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:17,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:19,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:20,335 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-18 10:27:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:25,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:27,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:28,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:29,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:31,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:35,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:37,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:38,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:39,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:41,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:43,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-18 10:27:45,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-18 10:27:47,452 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-18 10:27:49,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:53,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:55,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:57,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:27:59,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:28:02,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:28:04,244 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-18 10:28:06,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:28:08,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:28:10,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-18 10:28:12,111 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 [] Killed by 15