./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d 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/pthread-ext/02_inc_cas.i -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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 04:44:17,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 04:44:17,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-23 04:44:17,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 04:44:17,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 04:44:17,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 04:44:17,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 04:44:17,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 04:44:17,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 04:44:17,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 04:44:17,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 04:44:17,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 04:44:17,615 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 04:44:17,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 04:44:17,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 04:44:17,617 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 04:44:17,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 04:44:17,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 04:44:17,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 04:44:17,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 04:44:17,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 04:44:17,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 04:44:17,619 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 04:44:17,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 04:44:17,619 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 04:44:17,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 04:44:17,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 04:44:17,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 04:44:17,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 04:44:17,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 04:44:17,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 04:44:17,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 04:44:17,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 04:44:17,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 04:44:17,622 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-23 04:44:17,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 04:44:17,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 04:44:17,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-23 04:44:17,623 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 04:44:17,623 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-23 04:44:17,623 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-23 04:44:17,624 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2023-11-23 04:44:17,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 04:44:17,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 04:44:17,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 04:44:17,871 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 04:44:17,871 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 04:44:17,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-23 04:44:19,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 04:44:19,490 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 04:44:19,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-23 04:44:19,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/10b93738a/d06dd00bbe0c4e7a81e4100a41bb7347/FLAG7a0769665 [2023-11-23 04:44:19,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/10b93738a/d06dd00bbe0c4e7a81e4100a41bb7347 [2023-11-23 04:44:19,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 04:44:19,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 04:44:19,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 04:44:19,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 04:44:19,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 04:44:19,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:44:19" (1/1) ... [2023-11-23 04:44:19,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2202defc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:19, skipping insertion in model container [2023-11-23 04:44:19,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:44:19" (1/1) ... [2023-11-23 04:44:19,598 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 04:44:20,077 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-23 04:44:20,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 04:44:20,093 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 04:44:20,135 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-23 04:44:20,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 04:44:20,167 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 04:44:20,167 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 04:44:20,173 INFO L206 MainTranslator]: Completed translation [2023-11-23 04:44:20,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20 WrapperNode [2023-11-23 04:44:20,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 04:44:20,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 04:44:20,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 04:44:20,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 04:44:20,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,237 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-23 04:44:20,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 04:44:20,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 04:44:20,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 04:44:20,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 04:44:20,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 04:44:20,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 04:44:20,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 04:44:20,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 04:44:20,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (1/1) ... [2023-11-23 04:44:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 04:44:20,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:44:20,308 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) [2023-11-23 04:44:20,327 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 [2023-11-23 04:44:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 04:44:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-23 04:44:20,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-23 04:44:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 04:44:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 04:44:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 04:44:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 04:44:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 04:44:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 04:44:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 04:44:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 04:44:20,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 04:44:20,352 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 04:44:20,482 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 04:44:20,484 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 04:44:20,599 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 04:44:20,697 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 04:44:20,698 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 04:44:20,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:44:20 BoogieIcfgContainer [2023-11-23 04:44:20,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 04:44:20,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 04:44:20,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 04:44:20,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 04:44:20,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:44:19" (1/3) ... [2023-11-23 04:44:20,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6381bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:44:20, skipping insertion in model container [2023-11-23 04:44:20,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:44:20" (2/3) ... [2023-11-23 04:44:20,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6381bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:44:20, skipping insertion in model container [2023-11-23 04:44:20,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:44:20" (3/3) ... [2023-11-23 04:44:20,705 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-23 04:44:20,711 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 04:44:20,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 04:44:20,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 04:44:20,719 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 04:44:20,751 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 04:44:20,782 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:44:20,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 04:44:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:44:20,784 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) [2023-11-23 04:44:20,794 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 [2023-11-23 04:44:20,826 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 04:44:20,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-23 04:44:20,849 INFO L357 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, mHoare=true, 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;@65e223d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:44:20,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 04:44:20,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:44:20,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 19561318, now seen corresponding path program 1 times [2023-11-23 04:44:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662406039] [2023-11-23 04:44:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662406039] [2023-11-23 04:44:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662406039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:44:21,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:44:21,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 04:44:21,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326086563] [2023-11-23 04:44:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:44:21,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 04:44:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 04:44:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 04:44:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:21,281 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:21,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-23 04:44:21,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:21,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 04:44:21,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:44:21,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:21,410 INFO L85 PathProgramCache]: Analyzing trace with hash 691933217, now seen corresponding path program 1 times [2023-11-23 04:44:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484564798] [2023-11-23 04:44:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:22,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484564798] [2023-11-23 04:44:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484564798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:44:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:44:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 04:44:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811376652] [2023-11-23 04:44:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:44:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 04:44:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 04:44:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-23 04:44:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:22,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:22,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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) [2023-11-23 04:44:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:22,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 04:44:22,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 04:44:22,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:44:22,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash -833348320, now seen corresponding path program 1 times [2023-11-23 04:44:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294881121] [2023-11-23 04:44:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294881121] [2023-11-23 04:44:23,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294881121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:44:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001879513] [2023-11-23 04:44:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:23,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:44:23,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:44:23,233 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) [2023-11-23 04:44:23,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 04:44:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:23,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 04:44:23,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:44:23,389 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 04:44:23,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 04:44:23,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:44:23,441 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 04:44:23,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 04:44:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 04:44:23,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2023-11-23 04:44:23,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2023-11-23 04:44:23,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 19 [2023-11-23 04:44:23,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 04:44:23,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-23 04:44:31,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2023-11-23 04:44:31,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-23 04:44:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:32,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:44:32,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse0 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) is different from false [2023-11-23 04:44:32,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 .cse1))))) (store .cse2 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse0 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< (mod .cse1 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2023-11-23 04:44:32,574 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 0)))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-11-23 04:44:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-23 04:44:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001879513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:44:32,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:44:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 32 [2023-11-23 04:44:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926665164] [2023-11-23 04:44:32,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:44:32,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-23 04:44:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-23 04:44:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=721, Unknown=24, NotChecked=180, Total=1122 [2023-11-23 04:44:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:32,982 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:32,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 states have internal predecessors, (51), 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) [2023-11-23 04:44:32,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:32,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-23 04:44:32,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:33,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)) (.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= .cse7 (mod (select .cse10 |c_~#value~0.offset|) 4294967296)))) (and (forall ((v_ArrVal_67 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 0)))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_67 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse6 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 0) (or (not .cse5) (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_~v~0#1| 1))))) (store .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse8 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| 3)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1)))) is different from false [2023-11-23 04:44:35,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)) (.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= .cse7 (mod (select .cse10 |c_~#value~0.offset|) 4294967296)))) (and (forall ((v_ArrVal_67 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 0)))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_67 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse6 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 0) (or (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse8 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse5)) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| 3))))) is different from false [2023-11-23 04:44:49,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 04:44:51,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 04:44:53,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 04:44:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 04:44:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 04:44:54,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 04:44:54,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 04:44:54,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 04:44:54,352 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-23 04:44:54,356 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-23 04:44:54,360 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:44:54,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 04:44:54,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:44:54,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-23 04:44:54,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-11-23 04:44:54,396 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 04:44:54,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-23 04:44:54,398 INFO L357 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, mHoare=true, 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;@65e223d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:44:54,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 04:44:54,436 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:44:54,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1618562975, now seen corresponding path program 1 times [2023-11-23 04:44:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:54,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376100470] [2023-11-23 04:44:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:54,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:54,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376100470] [2023-11-23 04:44:54,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376100470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:44:54,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:44:54,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 04:44:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397178843] [2023-11-23 04:44:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:44:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 04:44:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:54,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 04:44:54,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 04:44:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:54,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-11-23 04:44:54,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 04:44:54,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:44:54,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash -772103782, now seen corresponding path program 1 times [2023-11-23 04:44:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491561122] [2023-11-23 04:44:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491561122] [2023-11-23 04:44:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491561122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:44:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:44:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 04:44:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584686941] [2023-11-23 04:44:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:44:54,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 04:44:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 04:44:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 04:44:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:54,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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) [2023-11-23 04:44:54,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 04:44:54,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 04:44:54,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:44:54,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1039098973, now seen corresponding path program 1 times [2023-11-23 04:44:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664224799] [2023-11-23 04:44:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 04:44:54,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 04:44:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 04:44:55,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 04:44:55,030 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 04:44:55,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-23 04:44:55,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 04:44:55,032 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-23 04:44:55,032 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-23 04:44:55,033 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 04:44:55,033 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-23 04:44:55,047 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 04:44:55,048 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:44:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 04:44:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:44:55,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-23 04:44:55,102 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 04:44:55,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-23 04:44:55,103 INFO L357 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, mHoare=true, 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;@65e223d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:44:55,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 04:44:55,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-23 04:44:55,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:44:55,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1017308915, now seen corresponding path program 1 times [2023-11-23 04:44:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49596206] [2023-11-23 04:44:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 04:44:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49596206] [2023-11-23 04:44:55,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49596206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:44:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:44:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 04:44:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792712467] [2023-11-23 04:44:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:44:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 04:44:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 04:44:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 04:44:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:55,256 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:55,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2023-11-23 04:44:55,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:55,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 04:44:55,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:44:55,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 335739395, now seen corresponding path program 1 times [2023-11-23 04:44:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493253306] [2023-11-23 04:44:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 04:44:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493253306] [2023-11-23 04:44:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493253306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:44:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:44:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 04:44:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077539270] [2023-11-23 04:44:55,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:44:55,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 04:44:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:44:55,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 04:44:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 04:44:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:55,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:44:55,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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) [2023-11-23 04:44:55,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:55,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:44:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:44:56,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 04:44:56,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:44:56,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:44:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -968851834, now seen corresponding path program 1 times [2023-11-23 04:44:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:44:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224249603] [2023-11-23 04:44:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:44:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:44:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224249603] [2023-11-23 04:44:56,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224249603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:44:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514751410] [2023-11-23 04:44:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:44:56,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:44:56,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:44:56,706 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) [2023-11-23 04:44:56,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 04:44:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:44:56,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 04:44:56,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:44:56,811 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 04:44:56,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 04:44:56,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:44:56,866 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 04:44:56,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 04:44:56,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 04:44:56,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:44:57,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 04:44:57,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:44:57,127 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 04:44:57,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 04:44:57,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 04:44:57,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:44:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:44:57,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:44:57,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_DerPreprocessor_4 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_5 (Array Int Int))) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_~vn~0#1|)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse0))))) is different from false [2023-11-23 04:44:59,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_197 Int) (|v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| Int) (v_ArrVal_198 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_198))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse3 4294967296))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_ArrVal_197) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) 0)) (< .cse0 (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse0 4294967295))))))) is different from false [2023-11-23 04:45:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:45:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514751410] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:45:06,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:45:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 37 [2023-11-23 04:45:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257381807] [2023-11-23 04:45:06,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:45:06,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-23 04:45:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:45:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-23 04:45:06,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1034, Unknown=25, NotChecked=138, Total=1406 [2023-11-23 04:45:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:06,246 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:45:06,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 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) [2023-11-23 04:45:06,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:06,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:45:06,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:45:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 04:45:07,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 04:45:07,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 04:45:07,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 04:45:07,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:45:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 942770601, now seen corresponding path program 1 times [2023-11-23 04:45:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:45:07,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855078219] [2023-11-23 04:45:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:45:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 04:45:07,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 04:45:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 04:45:07,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 04:45:07,936 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 04:45:07,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-23 04:45:07,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 04:45:07,939 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-23 04:45:07,939 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-23 04:45:07,939 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 04:45:07,939 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-23 04:45:07,963 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 04:45:07,965 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:45:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 04:45:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:45:07,966 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-23 04:45:07,971 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 04:45:07,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-23 04:45:07,972 INFO L357 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, mHoare=true, 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;@65e223d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 04:45:07,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 04:45:07,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-11-23 04:45:08,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:45:08,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:45:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1398027588, now seen corresponding path program 1 times [2023-11-23 04:45:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:45:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586001891] [2023-11-23 04:45:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:45:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:45:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 04:45:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:45:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586001891] [2023-11-23 04:45:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586001891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:45:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:45:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 04:45:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592784717] [2023-11-23 04:45:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:45:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 04:45:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:45:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 04:45:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 04:45:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,111 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:45:08,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) [2023-11-23 04:45:08,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 04:45:08,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:45:08,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:45:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1765456501, now seen corresponding path program 1 times [2023-11-23 04:45:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:45:08,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625968850] [2023-11-23 04:45:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:45:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:45:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 04:45:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:45:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625968850] [2023-11-23 04:45:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625968850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 04:45:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 04:45:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 04:45:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921197257] [2023-11-23 04:45:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 04:45:08,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 04:45:08,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:45:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 04:45:08,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 04:45:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,613 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:45:08,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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) [2023-11-23 04:45:08,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:45:08,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 04:45:08,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:45:08,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:45:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -923542824, now seen corresponding path program 1 times [2023-11-23 04:45:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:45:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447364310] [2023-11-23 04:45:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:45:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:45:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 04:45:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:45:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447364310] [2023-11-23 04:45:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447364310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:45:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762055712] [2023-11-23 04:45:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:09,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:45:09,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:45:09,450 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 04:45:09,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 04:45:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:45:09,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-23 04:45:09,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:45:09,572 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 04:45:09,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 04:45:09,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:09,648 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-23 04:45:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 04:45:09,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-23 04:45:09,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-23 04:45:09,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-23 04:45:10,026 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 04:45:10,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 04:45:10,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-11-23 04:45:10,238 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 04:45:10,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-23 04:45:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:45:10,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:45:10,379 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (= .cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2)) (or .cse2 (forall ((v_DerPreprocessor_8 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2023-11-23 04:45:10,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (v_ArrVal_349 Int)) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_349) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) is different from false [2023-11-23 04:45:10,729 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (v_ArrVal_349 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (or (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse1 (store (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350) |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_349) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (not .cse5)) (or .cse5 (forall ((v_DerPreprocessor_10 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (v_ArrVal_349 Int)) (or (let ((.cse7 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse6 (select .cse8 |c_~#value~0.offset|))) (< (mod .cse6 4294967296) (mod (select (select (store (store .cse7 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_349) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))))))) is different from false [2023-11-23 04:45:10,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (v_ArrVal_349 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (or (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse1 (store (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350) |c_~#value~0.base|))) (let ((.cse0 (select .cse2 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_349) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (not .cse5)) (or .cse5 (forall ((v_DerPreprocessor_10 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (v_ArrVal_349 Int)) (or (let ((.cse7 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_350))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse6 (select .cse8 |c_~#value~0.offset|))) (< (mod .cse6 4294967296) (mod (select (select (store (store .cse7 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_349) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))))))) is different from false [2023-11-23 04:45:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:45:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762055712] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:45:12,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:45:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2023-11-23 04:45:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575065030] [2023-11-23 04:45:12,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:45:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 04:45:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:45:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 04:45:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=16, NotChecked=212, Total=930 [2023-11-23 04:45:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:12,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:45:12,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 30 states have internal predecessors, (78), 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) [2023-11-23 04:45:12,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:12,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:45:12,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:45:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 04:45:13,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 04:45:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 04:45:14,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:45:14,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:45:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1217756251, now seen corresponding path program 1 times [2023-11-23 04:45:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:45:14,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563699251] [2023-11-23 04:45:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:45:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:45:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 04:45:14,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:45:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563699251] [2023-11-23 04:45:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563699251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:45:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843285836] [2023-11-23 04:45:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:45:14,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:45:14,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:45:14,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 04:45:14,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 04:45:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:45:14,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-23 04:45:14,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:45:14,645 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 04:45:14,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 04:45:14,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:14,725 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-23 04:45:14,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 04:45:14,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 04:45:14,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:14,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-23 04:45:15,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:15,085 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-23 04:45:15,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 04:45:15,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 04:45:15,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:15,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-23 04:45:15,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:15,530 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 04:45:15,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 04:45:15,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 04:45:15,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:45:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:45:15,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:45:17,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse4 |c_~#value~0.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse3))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_14))) (or (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439) |c_~#value~0.base|))) (let ((.cse0 (select .cse1 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439) |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_438) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1))))))) is different from false [2023-11-23 04:45:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 4 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-23 04:45:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843285836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:45:54,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:45:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 47 [2023-11-23 04:45:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047045855] [2023-11-23 04:45:54,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:45:54,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-23 04:45:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:45:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-23 04:45:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1881, Unknown=73, NotChecked=92, Total=2352 [2023-11-23 04:45:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:54,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:45:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 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) [2023-11-23 04:45:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:45:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:45:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-23 04:45:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:46:08,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:46:10,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:46:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:46:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:46:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 04:46:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-23 04:46:44,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 04:46:44,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:46:44,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:46:44,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:46:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash 89922600, now seen corresponding path program 1 times [2023-11-23 04:46:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:46:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643699385] [2023-11-23 04:46:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:46:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:46:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:46:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 04:46:47,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:46:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643699385] [2023-11-23 04:46:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643699385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:46:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100311205] [2023-11-23 04:46:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:46:47,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:46:47,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:46:47,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 04:46:47,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 04:46:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:46:47,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-23 04:46:47,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:46:47,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 04:46:48,090 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 04:46:48,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 04:46:48,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 04:46:48,740 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 04:46:48,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 04:46:49,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 04:46:49,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 04:46:49,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 04:46:49,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 04:46:49,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 04:46:49,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-11-23 04:46:50,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-11-23 04:46:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2023-11-23 04:46:50,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2023-11-23 04:46:50,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 04:46:50,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 04:46:50,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 04:46:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 04:46:50,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:46:53,603 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse1 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse2 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_549 Int) (v_ArrVal_553 (Array Int Int))) (= (mod (select (select (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_549)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_553) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse2) (or (forall ((v_ArrVal_549 Int) (v_ArrVal_553 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_549)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_553) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (not .cse2))))) (or .cse0 (forall ((v_DerPreprocessor_22 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_553) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))) is different from false [2023-11-23 04:46:53,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-23 04:46:53,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:46:53,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-23 04:46:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 4 refuted. 2 times theorem prover too weak. 10 trivial. 2 not checked. [2023-11-23 04:46:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100311205] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:46:54,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:46:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 25 [2023-11-23 04:46:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694917777] [2023-11-23 04:46:54,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:46:54,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 04:46:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:46:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 04:46:54,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=483, Unknown=5, NotChecked=44, Total=600 [2023-11-23 04:46:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:46:54,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:46:54,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 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) [2023-11-23 04:46:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:46:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:46:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-23 04:46:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-23 04:46:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:47:53,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:47:59,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:48:24,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:48:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:48:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:48:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-23 04:48:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-23 04:48:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 04:48:59,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 04:48:59,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 04:48:59,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:48:59,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:48:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1502622210, now seen corresponding path program 1 times [2023-11-23 04:48:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:48:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687279397] [2023-11-23 04:48:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:48:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:48:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:49:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:49:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:49:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687279397] [2023-11-23 04:49:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687279397] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:49:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858705976] [2023-11-23 04:49:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:49:08,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:49:08,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:49:08,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 04:49:08,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 04:49:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:49:08,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 04:49:08,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:49:09,063 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 04:49:09,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 04:49:09,619 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-23 04:49:09,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 04:49:10,683 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 04:49:10,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2023-11-23 04:49:10,980 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-23 04:49:10,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2023-11-23 04:49:11,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 04:49:11,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 04:49:11,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 04:49:12,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 04:49:12,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 04:49:12,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-11-23 04:49:12,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-11-23 04:49:12,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2023-11-23 04:49:12,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 04:49:12,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 04:49:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 04:49:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 04:49:13,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:49:14,637 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (or (forall ((v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int))) (= (mod (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_~#value~0.base| v_DerPreprocessor_26) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) is different from false [2023-11-23 04:49:15,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (let ((.cse4 (not .cse0)) (.cse1 (not .cse3))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (= (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse0) (or (and (or .cse1 (forall ((v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_ArrVal_658 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (= (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_658)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))) (or (forall ((v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_ArrVal_658 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (= (mod (select (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_32) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_658)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse3)) .cse4) (or (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) (and (or .cse4 (let ((.cse5 (forall ((v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_ArrVal_658 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (= (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_658)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_~#value~0.base| v_DerPreprocessor_26) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (and (or .cse1 .cse5) (or .cse3 .cse5)))) (or .cse0 (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_659 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (= (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_659) |c_~#value~0.base| v_DerPreprocessor_26) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))))) is different from false [2023-11-23 04:49:15,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-11-23 04:49:15,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-23 04:49:15,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:49:15,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-11-23 04:49:15,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-23 04:49:15,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:49:15,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:49:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 4 refuted. 2 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-23 04:49:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858705976] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:49:17,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:49:17,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7, 11] total 42 [2023-11-23 04:49:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123327529] [2023-11-23 04:49:17,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:49:17,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 04:49:17,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:49:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 04:49:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1397, Unknown=26, NotChecked=154, Total=1722 [2023-11-23 04:49:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:49:17,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:49:17,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 42 states have internal predecessors, (112), 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) [2023-11-23 04:49:17,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:49:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:49:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-23 04:49:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2023-11-23 04:49:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-23 04:49:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:50:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:50:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:50:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-23 04:50:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-11-23 04:50:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 04:50:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 04:50:44,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 04:50:44,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 04:50:44,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 04:50:44,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 04:50:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash -377992508, now seen corresponding path program 2 times [2023-11-23 04:50:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 04:50:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081356097] [2023-11-23 04:50:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 04:50:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 04:50:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 04:50:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 04:50:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 04:50:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081356097] [2023-11-23 04:50:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081356097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 04:50:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458783847] [2023-11-23 04:50:53,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 04:50:53,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 04:50:53,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 04:50:53,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 04:50:53,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 04:50:53,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 04:50:53,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 04:50:53,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 04:50:53,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 04:50:53,880 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 04:50:53,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 04:50:54,632 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-23 04:50:54,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 04:50:55,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-23 04:50:56,095 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-23 04:50:56,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-23 04:50:57,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 04:50:57,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-11-23 04:50:57,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 04:50:57,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 04:50:58,466 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-23 04:50:58,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-23 04:50:59,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 04:51:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 04:51:00,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 04:51:05,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 04:51:05,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:51:05,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:51:05,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-23 04:51:05,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-11-23 04:51:05,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 04:51:05,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 04:51:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 04:51:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458783847] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 04:51:10,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 04:51:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 44 [2023-11-23 04:51:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591452084] [2023-11-23 04:51:10,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 04:51:10,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-23 04:51:10,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 04:51:10,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-23 04:51:10,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1807, Unknown=11, NotChecked=0, Total=1980 [2023-11-23 04:51:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:51:10,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 04:51:10,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 44 states have internal predecessors, (101), 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) [2023-11-23 04:51:10,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:51:10,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-23 04:51:10,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-23 04:51:10,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2023-11-23 04:51:10,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-23 04:51:10,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-23 04:51:10,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 04:51:53,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:52:15,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 04:53:17,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:53:20,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:53:22,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 04:53:23,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15