./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 11:53:03,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 11:53:03,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 11:53:03,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 11:53:03,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 11:53:03,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 11:53:03,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 11:53:03,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 11:53:03,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 11:53:03,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 11:53:03,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 11:53:03,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 11:53:03,146 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 11:53:03,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 11:53:03,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 11:53:03,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 11:53:03,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 11:53:03,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 11:53:03,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 11:53:03,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 11:53:03,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 11:53:03,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 11:53:03,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 11:53:03,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 11:53:03,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 11:53:03,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 11:53:03,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 11:53:03,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 11:53:03,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 11:53:03,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 11:53:03,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 11:53:03,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 11:53:03,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 11:53:03,156 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 11:53:03,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 11:53:03,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 11:53:03,157 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 11:53:03,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 11:53:03,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 11:53:03,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 11:53:03,158 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 11:53:03,159 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-17 11:53:03,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 11:53:03,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 11:53:03,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 11:53:03,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 11:53:03,486 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 11:53:03,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-10-17 11:53:04,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 11:53:05,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 11:53:05,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-10-17 11:53:05,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/74a282efe/a6f51c753eb84f69a51a70b5fb5b2634/FLAG763fe3545 [2024-10-17 11:53:05,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/74a282efe/a6f51c753eb84f69a51a70b5fb5b2634 [2024-10-17 11:53:05,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 11:53:05,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 11:53:05,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 11:53:05,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 11:53:05,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 11:53:05,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210f3355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05, skipping insertion in model container [2024-10-17 11:53:05,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 11:53:05,400 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/bench-exp2x6.wvr.c[2505,2518] [2024-10-17 11:53:05,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 11:53:05,417 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 11:53:05,443 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/bench-exp2x6.wvr.c[2505,2518] [2024-10-17 11:53:05,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 11:53:05,465 INFO L204 MainTranslator]: Completed translation [2024-10-17 11:53:05,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05 WrapperNode [2024-10-17 11:53:05,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 11:53:05,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 11:53:05,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 11:53:05,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 11:53:05,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,509 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-10-17 11:53:05,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 11:53:05,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 11:53:05,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 11:53:05,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 11:53:05,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 11:53:05,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 11:53:05,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 11:53:05,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 11:53:05,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (1/1) ... [2024-10-17 11:53:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 11:53:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:53:05,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 11:53:05,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 11:53:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 11:53:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 11:53:05,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 11:53:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 11:53:05,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 11:53:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 11:53:05,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 11:53:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 11:53:05,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 11:53:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 11:53:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 11:53:05,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 11:53:05,626 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 11:53:05,743 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 11:53:05,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 11:53:06,007 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 11:53:06,007 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 11:53:06,181 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 11:53:06,181 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 11:53:06,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:53:06 BoogieIcfgContainer [2024-10-17 11:53:06,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 11:53:06,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 11:53:06,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 11:53:06,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 11:53:06,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 11:53:05" (1/3) ... [2024-10-17 11:53:06,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bf016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:53:06, skipping insertion in model container [2024-10-17 11:53:06,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:53:05" (2/3) ... [2024-10-17 11:53:06,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bf016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:53:06, skipping insertion in model container [2024-10-17 11:53:06,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:53:06" (3/3) ... [2024-10-17 11:53:06,191 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2024-10-17 11:53:06,205 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 11:53:06,206 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 11:53:06,206 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 11:53:06,258 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 11:53:06,295 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 11:53:06,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 11:53:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:53:06,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 11:53:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 11:53:06,388 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 11:53:06,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:53:06,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 11:53:06,418 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;@6c9e90cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 11:53:06,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 11:53:07,182 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-17 11:53:07,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:53:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash -387186802, now seen corresponding path program 1 times [2024-10-17 11:53:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:53:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143974953] [2024-10-17 11:53:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:53:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:53:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:53:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:07,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:53:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143974953] [2024-10-17 11:53:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143974953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 11:53:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 11:53:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-17 11:53:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294939364] [2024-10-17 11:53:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 11:53:07,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 11:53:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:53:07,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 11:53:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-17 11:53:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:53:07,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:53:07,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 11:53:07,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:53:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 11:53:07,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 11:53:07,774 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-17 11:53:07,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:53:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1417942700, now seen corresponding path program 1 times [2024-10-17 11:53:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:53:07,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417638319] [2024-10-17 11:53:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:53:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:53:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:53:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:53:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417638319] [2024-10-17 11:53:08,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417638319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:53:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277210956] [2024-10-17 11:53:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:53:08,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:53:08,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:53:08,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:53:08,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 11:53:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:53:08,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-17 11:53:08,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:53:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:10,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:53:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277210956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:53:10,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:53:10,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-17 11:53:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665067899] [2024-10-17 11:53:10,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:53:10,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-17 11:53:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:53:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-17 11:53:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-17 11:53:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:53:10,738 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:53:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 11:53:10,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 11:53:10,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:53:14,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 11:53:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 11:53:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 11:53:15,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 11:53:15,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-17 11:53:15,376 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-17 11:53:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:53:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1024235157, now seen corresponding path program 2 times [2024-10-17 11:53:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:53:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818670182] [2024-10-17 11:53:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:53:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:53:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:53:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:53:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818670182] [2024-10-17 11:53:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818670182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:53:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151738639] [2024-10-17 11:53:15,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:53:15,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:53:15,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:53:15,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:53:15,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 11:53:16,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:53:16,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:53:16,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-17 11:53:16,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:53:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:19,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:53:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 11:53:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151738639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:53:20,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:53:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-17 11:53:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455138672] [2024-10-17 11:53:20,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:53:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-17 11:53:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:53:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-17 11:53:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-17 11:53:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:53:20,347 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:53:20,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 11:53:20,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 11:53:20,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 11:53:20,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:53:23,486 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-17 11:53:26,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 11:53:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-17 11:53:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 11:53:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-17 11:53:30,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 11:53:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:53:30,338 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-17 11:53:30,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:53:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1138544086, now seen corresponding path program 3 times [2024-10-17 11:53:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:53:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471093551] [2024-10-17 11:53:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:53:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:53:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:53:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 11:53:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:53:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471093551] [2024-10-17 11:53:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471093551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:53:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348320596] [2024-10-17 11:53:34,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 11:53:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:53:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:53:34,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:53:34,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 11:53:38,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-17 11:53:38,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:53:38,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-17 11:53:38,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:58:02,296 WARN L286 SmtUtils]: Spent 13.50s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 11:59:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 37 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 11:59:42,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 12:02:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 12:02:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348320596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 12:02:55,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 12:02:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 59 [2024-10-17 12:02:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004317183] [2024-10-17 12:02:55,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 12:02:55,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-17 12:02:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 12:02:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-17 12:02:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3053, Unknown=113, NotChecked=0, Total=3540 [2024-10-17 12:02:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:02:55,271 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 12:02:55,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.85) internal successors, (111), 59 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 12:02:55,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-17 12:02:55,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 12:02:55,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-17 12:02:55,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 12:03:17,845 WARN L286 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 74 DAG size of output: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:03:22,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:26,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:29,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:31,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:33,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:35,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:37,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:39,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:41,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:43,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:46,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:47,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:49,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:03:51,329 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-17 12:03:53,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:04:00,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:04:02,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:04:04,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:04:06,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:04:30,931 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 77 DAG size of output: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:04:32,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:04:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:33,279 WARN L286 SmtUtils]: Spent 39.72s on a formula simplification. DAG size of input: 127 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-17 12:05:36,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:39,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:41,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:45,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:47,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:52,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:54,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:05:56,808 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-17 12:05:58,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:01,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:04,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_~x1~0 16)) (.cse5 (mod c_~n~0 4294967296)) (.cse9 (div c_~x3~0 16))) (let ((.cse1 (* 16 c_~x4~0)) (.cse0 (* (- 16) c_~x4~0)) (.cse8 (mod .cse9 4294967296)) (.cse2 (< .cse5 (+ (mod c_~x2~0 4294967296) 1))) (.cse6 (< (mod c_~x3~0 4294967296) .cse5)) (.cse3 (* 4294967296 (div c_~x3~0 4294967296))) (.cse4 (div c_~x2~0 16777216)) (.cse11 (* (- 1) c_~x2~0)) (.cse7 (mod .cse10 4294967296))) (and (<= c_~x3~0 (+ c_~x1~0 (* (div (+ .cse0 c_~x3~0) 16777216) 16777216) (* (div (* (- 1) c_~x1~0) 16) 16) .cse1)) (= (mod c_~x1~0 16) 0) (or .cse2 (and (= (+ c_~x3~0 (* (div c_~x4~0 268435456) 4294967296)) (+ .cse3 .cse1)) (= (+ c_~x1~0 (* .cse4 16777216)) (+ c_~x2~0 (* 16777216 (div c_~x1~0 16777216))))) (< (* (mod c_~x1~0 16777216) 256) .cse5) .cse6) (or (< (* 16 (mod c_~x3~0 268435456)) .cse5) (< .cse5 (+ (* (mod c_~x2~0 268435456) 16) 1)) (and (= (+ c_~x2~0 (* (div c_~x1~0 1048576) 1048576)) (+ (* 1048576 (div c_~x2~0 1048576)) c_~x1~0)) (= (+ (* 268435456 (div c_~x3~0 268435456)) .cse1) (+ c_~x3~0 (* 268435456 (div c_~x4~0 16777216))))) (< (* (mod c_~x1~0 1048576) 4096) .cse5)) (<= (+ .cse7 1) .cse5) (<= 1 .cse8) (<= (+ (* (div (+ .cse0 c_~x3~0 16777215) 16777216) 4294967296) (* 4294967296 (div c_~n~0 4294967296)) (* 4096 c_~x4~0) 1) (+ (* 1048576 (div (+ c_~x3~0 (- 16)) 16777216)) c_~n~0 (* 4095 .cse9))) (= (mod (* 15 c_~x2~0) 16) 0) (<= (* c_~x1~0 4097) (+ (* 16 .cse10) (* 268435456 (div (+ c_~x1~0 .cse11) 65536)) (* c_~x2~0 4096))) (= .cse8 (mod c_~x4~0 4294967296)) (or .cse2 (< (* 16 (mod c_~x1~0 268435456)) .cse5) .cse6 (and (= (+ .cse3 c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (= (+ (* 16 c_~x2~0) (* 268435456 (div c_~x1~0 268435456))) (+ (* 268435456 .cse4) c_~x1~0)))) (= .cse7 (mod (* 4294967295 (div .cse11 16)) 4294967296)) (<= 1 .cse7) (= (mod c_~x3~0 16) 0)))) is different from false [2024-10-17 12:06:06,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:08,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:11,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:13,616 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-17 12:06:15,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:17,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:21,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:22,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:26,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:29,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:31,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:33,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:35,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:37,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:40,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_~x1~0 16)) (.cse4 (* 4294967296 (div c_~x3~0 4294967296))) (.cse17 (div c_~x2~0 16777216)) (.cse9 (mod c_~n~0 4294967296)) (.cse13 (div c_~x3~0 16))) (let ((.cse1 (* 16 c_~x4~0)) (.cse0 (* (- 16) c_~x4~0)) (.cse12 (mod .cse13 4294967296)) (.cse8 (< (* 16 (mod c_~x3~0 268435456)) .cse9)) (.cse6 (< (* (mod c_~x1~0 16777216) 256) .cse9)) (.cse3 (div c_~x4~0 268435456)) (.cse10 (* 268435456 (div c_~x3~0 268435456))) (.cse5 (= (+ c_~x1~0 (* .cse17 16777216)) (+ c_~x2~0 (* 16777216 (div c_~x1~0 16777216))))) (.cse2 (< .cse9 (+ (mod c_~x2~0 4294967296) 1))) (.cse7 (< (mod c_~x3~0 4294967296) .cse9)) (.cse14 (= (+ .cse4 c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296)))) (.cse16 (* (- 1) c_~x2~0)) (.cse11 (mod .cse15 4294967296))) (and (<= c_~x3~0 (+ c_~x1~0 (* (div (+ .cse0 c_~x3~0) 16777216) 16777216) (* (div (* (- 1) c_~x1~0) 16) 16) .cse1)) (= (mod c_~x1~0 16) 0) (or .cse2 (and (= (+ c_~x3~0 (* .cse3 4294967296)) (+ .cse4 .cse1)) .cse5) .cse6 .cse7) (or .cse8 (< .cse9 (+ (* (mod c_~x2~0 268435456) 16) 1)) (and (= (+ c_~x2~0 (* (div c_~x1~0 1048576) 1048576)) (+ (* 1048576 (div c_~x2~0 1048576)) c_~x1~0)) (= (+ .cse10 .cse1) (+ c_~x3~0 (* 268435456 (div c_~x4~0 16777216))))) (< (* (mod c_~x1~0 1048576) 4096) .cse9)) (<= (+ .cse11 1) .cse9) (<= 1 .cse12) (<= (+ (* (div (+ .cse0 c_~x3~0 16777215) 16777216) 4294967296) (* 4294967296 (div c_~n~0 4294967296)) (* 4096 c_~x4~0) 1) (+ (* 1048576 (div (+ c_~x3~0 (- 16)) 16777216)) c_~n~0 (* 4095 .cse13))) (= (mod (* 15 c_~x2~0) 16) 0) (or .cse2 (and .cse5 .cse14) .cse6 .cse7) (<= (* c_~x1~0 4097) (+ (* 16 .cse15) (* 268435456 (div (+ c_~x1~0 .cse16) 65536)) (* c_~x2~0 4096))) (= .cse12 (mod c_~x4~0 4294967296)) (or .cse2 .cse8 .cse6 (and (= (+ c_~x3~0 (* 268435456 .cse3)) (+ .cse10 c_~x4~0)) .cse5)) (or .cse2 (< (* 16 (mod c_~x1~0 268435456)) .cse9) .cse7 (and .cse14 (= (+ (* 16 c_~x2~0) (* 268435456 (div c_~x1~0 268435456))) (+ (* 268435456 .cse17) c_~x1~0)))) (= .cse11 (mod (* 4294967295 (div .cse16 16)) 4294967296)) (<= 1 .cse11) (= (mod c_~x3~0 16) 0)))) is different from false [2024-10-17 12:06:45,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:52,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:53,504 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-17 12:06:55,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:06:59,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:01,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:09,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:12,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:15,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:18,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) c_~x1~0))) (let ((.cse8 (div .cse4 16)) (.cse7 (div c_~x3~0 16))) (let ((.cse5 (mod .cse7 4294967296)) (.cse6 (mod (div (* (- 1) .cse8) 16) 4294967296)) (.cse3 (* (- 1) c_~x4~0)) (.cse2 (mod c_~n~0 4294967296)) (.cse1 (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296)))) (.cse0 (* 16 c_~x2~0))) (and (= (mod c_~x4~0 16) 0) (or (and (= (+ .cse0 (* 4294967296 (div c_~x1~0 4294967296))) (+ (* (div c_~x2~0 268435456) 4294967296) c_~x1~0)) .cse1) (< (mod c_~x1~0 4294967296) .cse2)) (or (< (* 16 (mod c_~x3~0 268435456)) .cse2) (and (= (+ c_~x3~0 (* 268435456 (div c_~x4~0 268435456))) (+ (* 268435456 (div c_~x3~0 268435456)) c_~x4~0)) (= (+ c_~x1~0 (* 16777216 (div c_~x2~0 1048576))) (+ .cse0 (* 16777216 (div c_~x1~0 16777216))))) (< .cse2 (+ (* (mod c_~x2~0 268435456) 16) 1)) (< (* (mod c_~x1~0 16777216) 256) .cse2)) (<= (* c_~x3~0 16) (+ c_~x1~0 (* 268435456 (div (+ c_~x3~0 .cse3) 16777216)) (* 256 (div (+ .cse4 (* 16 c_~x4~0)) 256)))) (<= 1 .cse5) (= (mod (* 15 c_~x2~0) 16) 0) (<= (+ .cse6 1) .cse2) (= (mod (* 4294967295 (div (* (- 1) c_~x2~0) 16)) 4294967296) .cse6) (= .cse5 (mod (div c_~x4~0 16) 4294967296)) (<= 1 .cse6) (= (mod (* c_~x1~0 15) 16) 0) (<= (+ (* (div (+ c_~x3~0 .cse3 16777215) 16777216) 4294967296) (* 4294967296 (div c_~n~0 4294967296)) (* 256 c_~x4~0) 1) (+ (* 1048576 (div (+ c_~x3~0 (- 16)) 16777216)) c_~n~0 (* 4095 .cse7))) (or (< .cse2 (+ (mod c_~x2~0 4294967296) 1)) (< (* 16 (mod c_~x1~0 268435456)) .cse2) (< (mod c_~x3~0 4294967296) .cse2) (and .cse1 (= (+ .cse0 (* 268435456 (div c_~x1~0 268435456))) (+ (* 268435456 (div c_~x2~0 16777216)) c_~x1~0)))) (= (mod (* .cse8 15) 16) 0) (<= (* c_~x1~0 4097) (+ (* 256 (div c_~x1~0 256)) (* (div (+ (* (- 16) c_~x2~0) c_~x1~0) 1048576) 4294967296) (* 65536 c_~x2~0))) (= (mod c_~x3~0 16) 0))))) is different from false [2024-10-17 12:07:20,018 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-17 12:07:22,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:24,540 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-17 12:07:26,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:29,181 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-17 12:07:31,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-17 12:07:33,336 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-17 12:07:36,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15