./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 20174008 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-?-2017400-m [2023-11-24 08:04:57,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 08:04:57,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-24 08:04:57,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 08:04:57,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 08:04:58,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 08:04:58,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 08:04:58,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 08:04:58,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 08:04:58,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 08:04:58,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 08:04:58,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 08:04:58,015 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 08:04:58,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 08:04:58,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 08:04:58,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 08:04:58,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 08:04:58,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 08:04:58,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 08:04:58,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 08:04:58,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 08:04:58,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 08:04:58,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 08:04:58,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 08:04:58,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 08:04:58,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 08:04:58,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 08:04:58,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 08:04:58,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 08:04:58,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:04:58,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 08:04:58,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 08:04:58,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 08:04:58,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 08:04:58,022 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-24 08:04:58,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 08:04:58,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 08:04:58,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 08:04:58,022 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 08:04:58,023 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 08:04:58,023 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 08:04:58,023 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-24 08:04:58,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 08:04:58,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 08:04:58,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 08:04:58,261 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 08:04:58,262 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 08:04:58,262 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-24 08:04:59,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 08:04:59,476 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 08:04:59,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-24 08:04:59,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9102e302a/e1ae116b456b4207b57a5ce7c96c5cab/FLAG706e954ea [2023-11-24 08:04:59,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9102e302a/e1ae116b456b4207b57a5ce7c96c5cab [2023-11-24 08:04:59,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 08:04:59,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 08:04:59,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 08:04:59,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 08:04:59,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 08:04:59,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a350db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59, skipping insertion in model container [2023-11-24 08:04:59,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 08:04:59,805 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-24 08:04:59,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:04:59,822 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 08:04:59,848 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-24 08:04:59,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:04:59,875 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:04:59,875 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:04:59,881 INFO L206 MainTranslator]: Completed translation [2023-11-24 08:04:59,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59 WrapperNode [2023-11-24 08:04:59,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 08:04:59,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 08:04:59,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 08:04:59,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 08:04:59,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,931 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-24 08:04:59,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 08:04:59,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 08:04:59,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 08:04:59,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 08:04:59,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 08:04:59,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 08:04:59,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 08:04:59,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 08:04:59,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (1/1) ... [2023-11-24 08:04:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:04:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:00,000 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-24 08:05:00,019 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-24 08:05:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 08:05:00,042 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-24 08:05:00,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-24 08:05:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 08:05:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 08:05:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 08:05:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 08:05:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 08:05:00,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 08:05:00,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 08:05:00,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 08:05:00,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 08:05:00,046 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 08:05:00,171 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 08:05:00,177 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 08:05:00,304 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 08:05:00,383 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 08:05:00,384 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 08:05:00,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:05:00 BoogieIcfgContainer [2023-11-24 08:05:00,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 08:05:00,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 08:05:00,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 08:05:00,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 08:05:00,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 08:04:59" (1/3) ... [2023-11-24 08:05:00,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e25a096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:05:00, skipping insertion in model container [2023-11-24 08:05:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:04:59" (2/3) ... [2023-11-24 08:05:00,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e25a096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:05:00, skipping insertion in model container [2023-11-24 08:05:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:05:00" (3/3) ... [2023-11-24 08:05:00,390 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-24 08:05:00,396 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 08:05:00,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 08:05:00,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 08:05:00,403 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 08:05:00,434 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:00,465 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:00,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:00,466 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-24 08:05:00,467 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-24 08:05:00,519 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:00,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-24 08:05:00,555 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;@27432bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:00,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:05:00,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:00,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 19561318, now seen corresponding path program 1 times [2023-11-24 08:05:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247600] [2023-11-24 08:05:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:00,792 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-24 08:05:00,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247600] [2023-11-24 08:05:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932576045] [2023-11-24 08:05:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:00,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:00,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:00,821 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:00,821 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-24 08:05:00,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:00,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 08:05:00,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:00,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash 691933217, now seen corresponding path program 1 times [2023-11-24 08:05:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:00,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688651727] [2023-11-24 08:05:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:01,660 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-24 08:05:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688651727] [2023-11-24 08:05:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688651727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 08:05:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971091691] [2023-11-24 08:05:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:01,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 08:05:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 08:05:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 08:05:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:01,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:01,667 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-24 08:05:01,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:01,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:05:02,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 08:05:02,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:02,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -833348320, now seen corresponding path program 1 times [2023-11-24 08:05:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99729450] [2023-11-24 08:05:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:02,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:02,951 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-24 08:05:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99729450] [2023-11-24 08:05:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99729450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:05:02,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625121968] [2023-11-24 08:05:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:02,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:05:02,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:03,017 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-24 08:05:03,032 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-24 08:05:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:03,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-24 08:05:03,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:03,156 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 08:05:03,157 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-24 08:05:03,176 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-24 08:05:03,208 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 08:05:03,209 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-24 08:05:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:05:03,285 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-24 08:05:03,294 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-24 08:05:03,338 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-24 08:05:03,342 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-24 08:05:03,428 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-24 08:05:11,681 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-24 08:05:11,766 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-24 08:05:11,878 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-24 08:05:11,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:11,983 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-24 08:05:12,366 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-24 08:05:12,759 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-24 08:05:13,215 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-24 08:05:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625121968] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:13,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:05:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 32 [2023-11-24 08:05:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125956881] [2023-11-24 08:05:13,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:13,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-24 08:05:13,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:13,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-24 08:05:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=720, Unknown=25, NotChecked=180, Total=1122 [2023-11-24 08:05:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:13,219 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:13,219 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-24 08:05:13,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:13,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:05:13,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:13,487 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-24 08:05:15,533 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-24 08:05:30,106 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-24 08:05:32,133 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-24 08:05:34,143 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-24 08:05:36,159 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-24 08:05:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:05:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 08:05:36,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-24 08:05:36,397 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-24 08:05:36,598 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-24 08:05:36,607 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-24 08:05:36,609 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-24 08:05:36,611 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:36,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:36,616 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-24 08:05:36,617 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-24 08:05:36,649 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:36,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 08:05:36,650 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;@27432bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:36,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:05:36,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:36,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1618562975, now seen corresponding path program 1 times [2023-11-24 08:05:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352828857] [2023-11-24 08:05:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:36,706 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-24 08:05:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:36,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352828857] [2023-11-24 08:05:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352828857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882159661] [2023-11-24 08:05:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:36,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:36,709 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-24 08:05:36,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 08:05:36,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:36,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -772103782, now seen corresponding path program 1 times [2023-11-24 08:05:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820699030] [2023-11-24 08:05:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:37,001 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-24 08:05:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820699030] [2023-11-24 08:05:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820699030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:37,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:37,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 08:05:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358468724] [2023-11-24 08:05:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:37,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 08:05:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 08:05:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 08:05:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:37,005 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-24 08:05:37,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:05:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 08:05:37,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:37,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1039098973, now seen corresponding path program 1 times [2023-11-24 08:05:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:37,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618962231] [2023-11-24 08:05:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:37,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 08:05:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:37,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 08:05:37,261 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 08:05:37,261 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 08:05:37,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 08:05:37,263 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-24 08:05:37,264 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-24 08:05:37,265 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 08:05:37,265 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 08:05:37,277 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:37,279 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:37,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:37,280 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-24 08:05:37,285 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:37,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 08:05:37,286 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;@27432bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:37,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:05:37,300 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-24 08:05:37,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:37,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1017308915, now seen corresponding path program 1 times [2023-11-24 08:05:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:37,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173501732] [2023-11-24 08:05:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:37,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:37,374 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-24 08:05:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173501732] [2023-11-24 08:05:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173501732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:37,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546186575] [2023-11-24 08:05:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:37,379 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-24 08:05:37,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 08:05:37,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:37,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 335739395, now seen corresponding path program 1 times [2023-11-24 08:05:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475408792] [2023-11-24 08:05:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:38,158 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-24 08:05:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475408792] [2023-11-24 08:05:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475408792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:38,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:38,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 08:05:38,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164795222] [2023-11-24 08:05:38,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:38,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 08:05:38,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:38,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 08:05:38,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-24 08:05:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:38,175 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-24 08:05:38,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:05:38,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 08:05:38,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:38,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash -968851834, now seen corresponding path program 1 times [2023-11-24 08:05:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096386763] [2023-11-24 08:05:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:38,967 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-24 08:05:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096386763] [2023-11-24 08:05:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096386763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:05:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445111843] [2023-11-24 08:05:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:38,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:05:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:38,969 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-24 08:05:38,996 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-24 08:05:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:39,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-24 08:05:39,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:39,074 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:05:39,075 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-24 08:05:39,095 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-24 08:05:39,118 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:05:39,119 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-24 08:05:39,208 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-24 08:05:39,211 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-24 08:05:39,288 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-24 08:05:39,315 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-24 08:05:39,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:05:39,346 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-24 08:05:39,430 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-24 08:05:39,432 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-24 08:05:39,460 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-24 08:05:39,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:46,772 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-24 08:05:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445111843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:46,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:05:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 37 [2023-11-24 08:05:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179272222] [2023-11-24 08:05:46,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-24 08:05:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-24 08:05:46,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1151, Unknown=36, NotChecked=0, Total=1406 [2023-11-24 08:05:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:46,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:46,775 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-24 08:05:46,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:46,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:05:46,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:05:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 08:05:48,045 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-24 08:05:48,231 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-24 08:05:48,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:48,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash 942770601, now seen corresponding path program 1 times [2023-11-24 08:05:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:48,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235766864] [2023-11-24 08:05:48,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:48,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 08:05:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:48,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 08:05:48,372 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 08:05:48,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 08:05:48,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 08:05:48,374 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 08:05:48,375 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-24 08:05:48,375 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 08:05:48,375 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-24 08:05:48,394 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:48,396 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:48,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:48,397 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-24 08:05:48,402 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:48,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-24 08:05:48,403 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;@27432bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:48,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:05:48,417 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-24 08:05:48,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:48,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1398027588, now seen corresponding path program 1 times [2023-11-24 08:05:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546145576] [2023-11-24 08:05:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:48,568 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-24 08:05:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546145576] [2023-11-24 08:05:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546145576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:48,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237822311] [2023-11-24 08:05:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:48,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:48,571 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:48,571 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-24 08:05:48,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:48,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 08:05:48,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:48,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1765456501, now seen corresponding path program 1 times [2023-11-24 08:05:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:48,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076422749] [2023-11-24 08:05:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:48,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:49,174 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-24 08:05:49,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:49,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076422749] [2023-11-24 08:05:49,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076422749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:49,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:49,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 08:05:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633090501] [2023-11-24 08:05:49,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:49,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 08:05:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 08:05:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-24 08:05:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:49,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:49,175 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-24 08:05:49,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:49,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:05:49,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 08:05:49,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:49,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -923542824, now seen corresponding path program 1 times [2023-11-24 08:05:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:49,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574689884] [2023-11-24 08:05:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:50,089 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-24 08:05:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574689884] [2023-11-24 08:05:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574689884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:05:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811078215] [2023-11-24 08:05:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:05:50,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:50,092 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-24 08:05:50,112 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-24 08:05:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:50,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-24 08:05:50,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:50,217 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 08:05:50,218 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-24 08:05:50,253 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-24 08:05:50,293 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 08:05:50,293 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-24 08:05:50,426 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-24 08:05:50,546 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-24 08:05:50,616 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-24 08:05:50,666 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 08:05:50,667 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-24 08:05:50,870 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-24 08:05:50,886 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 08:05:50,886 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-24 08:05:50,932 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-24 08:05:50,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:06:10,203 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-24 08:06:10,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811078215] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:06:10,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:06:10,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2023-11-24 08:06:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608278812] [2023-11-24 08:06:10,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:06:10,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-24 08:06:10,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:06:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-24 08:06:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=749, Unknown=43, NotChecked=0, Total=930 [2023-11-24 08:06:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:10,205 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:06:10,205 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-24 08:06:10,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:10,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:06:10,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:06:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:06:12,018 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-24 08:06:12,207 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-24 08:06:12,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:06:12,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:06:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1217756251, now seen corresponding path program 1 times [2023-11-24 08:06:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:06:12,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034313922] [2023-11-24 08:06:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:06:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:06:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:06:12,761 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-24 08:06:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:06:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034313922] [2023-11-24 08:06:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034313922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:06:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323067806] [2023-11-24 08:06:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:06:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:06:12,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:06:12,763 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-24 08:06:12,763 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-24 08:06:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:06:12,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 08:06:12,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:06:12,928 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 08:06:12,931 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-24 08:06:12,966 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-24 08:06:13,015 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 08:06:13,015 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-24 08:06:13,176 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-24 08:06:13,181 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-24 08:06:13,297 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-24 08:06:13,344 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-24 08:06:13,393 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 08:06:13,394 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-24 08:06:13,568 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-24 08:06:13,577 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-24 08:06:13,725 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-24 08:06:13,781 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-24 08:06:13,883 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 08:06:13,883 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-24 08:06:14,000 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-24 08:06:14,003 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-24 08:06:14,047 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-24 08:06:14,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:06:14,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_439 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_ArrVal_438 Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_438) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439))) (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_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2023-11-24 08:06:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:06:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323067806] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:06:49,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:06:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 47 [2023-11-24 08:06:49,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592303891] [2023-11-24 08:06:49,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:06:49,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-24 08:06:49,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:06:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-24 08:06:49,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1877, Unknown=78, NotChecked=92, Total=2352 [2023-11-24 08:06:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:49,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:06:49,611 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-24 08:06:49,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:49,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:06:49,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:06:49,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:00,752 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-24 08:07:02,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:07:04,886 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 [1] [2023-11-24 08:07:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:07:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:07:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-24 08:07:10,690 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-24 08:07:10,875 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-24 08:07:10,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:07:10,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:07:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 89922600, now seen corresponding path program 1 times [2023-11-24 08:07:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:07:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959946119] [2023-11-24 08:07:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:07:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:07:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:07:12,430 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-24 08:07:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:07:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959946119] [2023-11-24 08:07:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959946119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:07:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706152860] [2023-11-24 08:07:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:07:12,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:07:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:07:12,432 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-24 08:07:12,434 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-24 08:07:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:07:12,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 08:07:12,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:07:12,567 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-24 08:07:12,615 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:07:12,616 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-24 08:07:12,679 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-24 08:07:12,706 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:07:12,706 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-24 08:07:12,762 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-24 08:07:12,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:07:12,785 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-24 08:07:12,849 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-24 08:07:12,856 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-24 08:07:12,865 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-24 08:07:12,874 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-24 08:07:12,946 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-24 08:07:12,950 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-24 08:07:12,956 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-24 08:07:12,976 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-24 08:07:12,983 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-24 08:07:13,013 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-24 08:07:13,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:07:15,336 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-24 08:07: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 7 treesize of output 5 [2023-11-24 08:07:15,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:07:15,410 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-24 08:07:15,712 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-24 08:07:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706152860] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:07:15,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:07:15,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 25 [2023-11-24 08:07:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385549737] [2023-11-24 08:07:15,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:07:15,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 08:07:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:07:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 08:07:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=475, Unknown=13, NotChecked=44, Total=600 [2023-11-24 08:07:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:15,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:07:15,715 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-24 08:07:15,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:15,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:07:15,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:07:15,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-24 08:07:15,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:40,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:07:59,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:00,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:02,988 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 [1] [2023-11-24 08:08:04,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:08,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse11 (select .cse4 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse11 4294967296)) (.cse3 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse2 (= .cse0 .cse3)) (.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse11))))) (and (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (forall ((v_DerPreprocessor_11 (Array Int Int))) (< .cse0 (mod (select (select (store .cse1 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (or (not .cse2) (forall ((v_DerPreprocessor_11 (Array Int Int))) (< .cse3 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_439 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439))) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse5 4294967296) (mod (select (select (store (store .cse6 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse5 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| 0) 3) 1) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_DerPreprocessor_12 (Array Int Int))) (< .cse3 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (= |c_~#value~0.base| 3) (forall ((v_DerPreprocessor_11 (Array Int Int))) (< .cse0 (mod (select (select (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_439 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_ArrVal_438 Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_438) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439))) (let ((.cse10 (select .cse9 |c_~#value~0.base|))) (let ((.cse8 (select .cse10 |c_~#value~0.offset|))) (< (mod .cse8 4294967296) (mod (select (select (store (store .cse9 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (< .cse0 (+ (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) 1)))))))) is different from false [2023-11-24 08:08:28,942 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-24 08:08:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:08:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 08:08:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-11-24 08:08:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 08:08:39,675 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-24 08:08:39,860 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-24 08:08:39,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:08:39,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:08:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1502622210, now seen corresponding path program 1 times [2023-11-24 08:08:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:08:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131838373] [2023-11-24 08:08:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:08:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:43,366 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-24 08:08:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:08:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131838373] [2023-11-24 08:08:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131838373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:08:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273678961] [2023-11-24 08:08:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:43,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:08:43,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:08:43,369 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-24 08:08:43,377 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-24 08:08:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:43,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-24 08:08:43,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:08:43,566 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 08:08:43,568 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-24 08:08:43,697 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-24 08:08:43,697 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-24 08:08:43,906 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 08:08:43,907 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-24 08:08:43,983 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-24 08:08:43,983 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-24 08:08:44,179 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-24 08:08:44,223 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-24 08:08:44,239 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-24 08:08:44,266 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-24 08:08:44,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:08:44,462 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-24 08:08:44,471 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-24 08:08:44,477 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-24 08:08:44,495 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-24 08:08:44,514 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-24 08:08:44,523 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-24 08:08:44,600 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-24 08:08:44,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:08:45,230 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-24 08:08:45,557 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-24 08:08:45,688 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-24 08:08:45,722 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-24 08:08:45,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:08:45,758 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-24 08:08:45,766 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-24 08:08:45,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:08:45,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:08:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 3 refuted. 3 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-24 08:08:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273678961] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:08:46,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:08:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7, 11] total 42 [2023-11-24 08:08:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811881747] [2023-11-24 08:08:46,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:08:46,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-24 08:08:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:08:46,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-24 08:08:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1402, Unknown=21, NotChecked=154, Total=1722 [2023-11-24 08:08:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:46,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:08:46,624 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-24 08:08:46,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:46,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:08:46,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-24 08:08:46,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2023-11-24 08:08:46,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-24 08:08:46,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:50,229 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-24 08:08:52,294 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-24 08:09:25,619 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 [1] [2023-11-24 08:10:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:10:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-24 08:10:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-11-24 08:10:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 08:10:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:10:13,415 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-24 08:10:13,603 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-24 08:10:13,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:10:13,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:10:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash -377992508, now seen corresponding path program 2 times [2023-11-24 08:10:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:10:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422988212] [2023-11-24 08:10:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:10:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:16,169 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-24 08:10:16,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:10:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422988212] [2023-11-24 08:10:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422988212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:10:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860881507] [2023-11-24 08:10:16,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:10:16,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:10:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:10:16,171 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-24 08:10:16,172 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-24 08:10:16,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:10:16,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:10:16,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 08:10:16,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:10:16,322 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 08:10:16,322 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-24 08:10:16,441 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 08:10:16,442 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-24 08:10:16,640 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-24 08:10:16,737 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-24 08:10:16,737 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-24 08:10:16,957 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-24 08:10:16,962 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-24 08:10:16,965 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-24 08:10:17,045 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-24 08:10:17,182 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-24 08:10:17,182 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-24 08:10:17,370 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-24 08:10:17,471 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-24 08:10:17,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:10:17,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_DerPreprocessor_38 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse0) (or (not .cse0) (let ((.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (not .cse1) (forall ((v_DerPreprocessor_35 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_36) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse1)))))) is different from false [2023-11-24 08:10:18,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:18,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:10:18,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:10:18,843 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-24 08:10:18,849 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-24 08:10:18,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:18,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:10:19,847 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-24 08:10:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860881507] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:10:19,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:10:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 44 [2023-11-24 08:10:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542981179] [2023-11-24 08:10:19,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:10:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-24 08:10:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:10:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-24 08:10:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1728, Unknown=8, NotChecked=84, Total=1980 [2023-11-24 08:10:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:19,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:10:19,850 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-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2023-11-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:10:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:35,685 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-24 08:10:53,951 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-24 08:11:54,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:12:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2023-11-24 08:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 08:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 08:12:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-24 08:12:22,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-24 08:12:23,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-24 08:12:23,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:12:23,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:12:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2020339007, now seen corresponding path program 2 times [2023-11-24 08:12:23,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:12:23,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193937824] [2023-11-24 08:12:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:12:23,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:12:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:12:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:12:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:12:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193937824] [2023-11-24 08:12:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193937824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:12:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870524301] [2023-11-24 08:12:24,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:12:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:12:24,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:12:24,128 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 08:12:24,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-24 08:12:24,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:12:24,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:12:24,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 08:12:24,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:12:24,413 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:12:24,413 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-24 08:12:25,426 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-24 08:12:25,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 08:12:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:12:26,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:12:26,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-11-24 08:12:27,660 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_824) |c_~#value~0.base|) |c_~#value~0.offset|))) (< .cse0 (+ (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (* (div .cse0 4294967296) 4294967296) 1)))) is different from false [2023-11-24 08:12:27,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-11-24 08:12:27,736 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 19 treesize of output 15 [2023-11-24 08:12:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-11-24 08:12:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870524301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:12:28,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:12:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2023-11-24 08:12:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656850458] [2023-11-24 08:12:28,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:12:28,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 08:12:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:12:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 08:12:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2023-11-24 08:12:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:12:28,069 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:12:28,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 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-24 08:12:28,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:12:28,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:12:28,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:12:28,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2023-11-24 08:12:28,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 08:12:28,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-24 08:12:28,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-24 08:12:28,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:12:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:12:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:12:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:12:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2023-11-24 08:12:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 08:12:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 08:12:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:12:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:12:50,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-24 08:12:50,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-24 08:12:50,429 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:12:50,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:12:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash -901005844, now seen corresponding path program 1 times [2023-11-24 08:12:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:12:50,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332023690] [2023-11-24 08:12:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:12:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:12:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:12:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 08:12:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:12:54,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332023690] [2023-11-24 08:12:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332023690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:12:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380915080] [2023-11-24 08:12:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:12:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:12:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:12:54,298 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 08:12:54,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-24 08:12:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:12:54,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-24 08:12:54,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:12:54,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:12:54,654 INFO L224 Elim1Store]: Index analysis took 128 ms [2023-11-24 08:12:54,994 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 08:12:54,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 36 [2023-11-24 08:12:55,680 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-24 08:12:56,409 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2023-11-24 08:12:56,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2023-11-24 08:12:58,749 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 35 treesize of output 18 [2023-11-24 08:13:01,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2023-11-24 08:13:02,623 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 08:13:02,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-24 08:13:03,924 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2023-11-24 08:13:03,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2023-11-24 08:13:06,367 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-24 08:13:07,368 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-24 08:13:07,368 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-24 08:13:09,540 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-24 08:13:09,560 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-24 08:13:10,036 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 19 treesize of output 18 [2023-11-24 08:13:10,946 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-24 08:13:10,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:13:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:13:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380915080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:13:59,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:13:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 19] total 51 [2023-11-24 08:13:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569480391] [2023-11-24 08:13:59,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:13:59,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-24 08:13:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:13:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-24 08:13:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2305, Unknown=53, NotChecked=0, Total=2652 [2023-11-24 08:13:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:59,190 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:13:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.75) internal successors, (91), 51 states have internal predecessors, (91), 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-24 08:13:59,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:13:59,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:14:12,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (select .cse0 |c_~#value~0.offset|))) (let ((.cse3 (mod .cse7 4294967296))) (let ((.cse2 (= .cse3 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (+ 1 .cse7))))) (and (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1))) (not .cse2)) (= (select |c_#valid| 3) 1) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse2) (not (= .cse1 .cse3)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= .cse1 (mod (select (select (store .cse4 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((v_ArrVal_902 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (or (not (= (mod (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902))) (store .cse5 |c_~#value~0.base| (let ((.cse6 (select .cse5 |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)))) (= |c_~#value~0.base| 3) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= .cse1 (mod (select (select (store .cse4 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-11-24 08:14:24,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:14:26,825 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-24 08:14:29,381 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-24 08:14:37,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:14:39,379 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 [1] [2023-11-24 08:14:42,426 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-24 08:14:44,445 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-24 08:14:46,496 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 [1] [2023-11-24 08:14:48,717 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-24 08:14:50,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:14:53,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:14:55,885 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-24 08:14:57,901 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-24 08:15:00,727 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-24 08:15:03,925 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-24 08:15:05,937 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-24 08:15:07,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:15:09,204 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 [1] [2023-11-24 08:15:23,085 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 [1] [2023-11-24 08:15:25,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:15:27,345 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-24 08:15:29,357 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-24 08:15:31,422 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 [1] [2023-11-24 08:15:33,500 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 [1] [2023-11-24 08:15:35,547 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 [1] [2023-11-24 08:15:37,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:15:39,899 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-24 08:15:41,914 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-24 08:15:44,085 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 [1] [2023-11-24 08:15:46,117 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 [1] [2023-11-24 08:15:48,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:15:50,229 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 [1] [2023-11-24 08:15:54,086 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 [1] [2023-11-24 08:15:56,154 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-24 08:15:58,171 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-24 08:16:01,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:16:03,231 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 [1] [2023-11-24 08:16:25,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse0 |c_~#value~0.offset|))) (let ((.cse4 (mod .cse8 4294967296))) (let ((.cse3 (= .cse4 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (let ((.cse2 (not .cse3)) (.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (+ 1 .cse8))))) (and (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1))) .cse2) (= (select |c_#valid| 3) 1) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse3) (not (= .cse1 .cse4)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= .cse1 (mod (select (select (store .cse5 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) .cse2) (forall ((v_ArrVal_902 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (or (not (= (mod (select (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902))) (store .cse6 |c_~#value~0.base| (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (store .cse7 |c_~#value~0.offset| (+ (select .cse7 |c_~#value~0.offset|) 1))))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)))) (= |c_~#value~0.base| 3) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= .cse1 (mod (select (select (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-11-24 08:17:00,135 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 [1] [2023-11-24 08:17:02,153 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-24 08:17:15,872 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse20 (select .cse19 |c_~#value~0.offset|))) (let ((.cse13 (+ (mod .cse20 4294967296) 1)) (.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| (+ 1 .cse20))))) (and (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (v_ArrVal_901 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_ArrVal_893 (Array Int Int)) (v_ArrVal_899 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_893))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse2 (select .cse8 |c_~#value~0.offset|))) (let ((.cse5 (store .cse8 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store .cse7 |c_~#value~0.base| .cse5))) (let ((.cse1 (store (select .cse0 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) (.cse6 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| v_ArrVal_899))) (or (< (mod (select (select (store .cse0 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (not (let ((.cse3 (store (store |c_#memory_int| |c_~#value~0.base| .cse5) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| .cse1))) (= (mod (select (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_900) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902) |c_~#value~0.base| (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902) |c_~#value~0.base|))) (store .cse4 |c_~#value~0.offset| (+ (select .cse4 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_901) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (select .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27|) 0)))))))))) (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (v_ArrVal_901 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_ArrVal_899 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (let ((.cse9 (store (select .cse14 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse11 (store .cse14 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| .cse9)) (.cse12 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| v_ArrVal_899))) (or (not (= (mod (select (select (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27| .cse9) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902) |c_~#value~0.base| (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902) |c_~#value~0.base|))) (store .cse10 |c_~#value~0.offset| (+ (select .cse10 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_900) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (select (store .cse12 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_901) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)) (< (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (not (= (select .cse12 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_27|) 0)))))) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (v_ArrVal_901 Int) (v_DerPreprocessor_44 (Array Int Int)) (v_ArrVal_899 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| Int)) (let ((.cse17 (store (select .cse14 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse15 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_899)) (.cse16 (store .cse14 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse17))) (or (not (= (select .cse15 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (< (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (not (= (select (store .cse15 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_901) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select (select (store .cse16 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_900) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902) |c_~#value~0.base| (let ((.cse18 (select (store .cse16 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_902) |c_~#value~0.base|))) (store .cse18 |c_~#value~0.offset| (+ (select .cse18 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_23| v_DerPreprocessor_44) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) is different from false [2023-11-24 08:17:20,174 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 [1] [2023-11-24 08:17:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:17:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:17:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:17:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2023-11-24 08:17:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 08:17:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-24 08:17:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-24 08:17:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:17:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-24 08:17:55,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-24 08:17:55,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:17:55,384 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:17:55,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:17:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1295977930, now seen corresponding path program 1 times [2023-11-24 08:17:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:17:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151947383] [2023-11-24 08:17:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:17:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:17:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:18:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:18:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:18:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151947383] [2023-11-24 08:18:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151947383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:18:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155763985] [2023-11-24 08:18:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:18:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:18:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:18:05,924 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 08:18:05,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-24 08:18:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:18:06,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-24 08:18:06,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:18:06,302 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:18:06,303 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-24 08:18:07,073 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 08:18:07,073 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-24 08:18:08,062 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-24 08:18:08,497 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 08:18:08,497 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-24 08:18:09,712 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 08:18:09,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 08:18:12,116 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-24 08:18:12,216 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-24 08:18:12,245 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-24 08:18:13,126 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-11-24 08:18:13,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 137 [2023-11-24 08:18:13,166 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 37 treesize of output 40 [2023-11-24 08:18:13,190 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 34 treesize of output 37 [2023-11-24 08:18:13,968 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-24 08:18:13,968 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 2 case distinctions, treesize of input 48 treesize of output 35 [2023-11-24 08:18:14,009 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 3 [2023-11-24 08:18:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 08:18:16,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:18:26,942 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse6 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse4 (not .cse6)) (.cse1 (not .cse11)) (.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) .cse1 (and (or (forall ((v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< 0 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store .cse2 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse4) (or (forall ((v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_55 (Array Int Int))) (< 0 (mod (select (select (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store (store .cse5 |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store .cse5 |c_~#value~0.base| (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse6))) (or (and (or (and (or .cse4 (forall ((v_subst_15 Int) (v_prenex_37 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_59))) (let ((.cse8 (store (select (store .cse9 |c_~#value~0.base| (store (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_37)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse7 (store .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse8))) (or (< 0 (mod (select (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| v_DerPreprocessor_53) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| (store (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset| v_subst_15)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (or (forall ((v_prenex_36 Int) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (< 0 (mod (select (select (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_59))) (store (store .cse10 |c_~#value~0.base| v_DerPreprocessor_58) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| (store (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_36)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse6)) .cse11) (or (and (or .cse4 (forall ((v_subst_14 Int) (v_prenex_35 Int) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_59))) (let ((.cse13 (store (select (store .cse14 |c_~#value~0.base| (store (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_35)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse13))) (or (< 0 (mod (select (select .cse12 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse12 |c_~#value~0.base| (store (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset| v_subst_14)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (or (forall ((v_ArrVal_1056 Int) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (< 0 (mod (select (select (let ((.cse15 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_59))) (store (store .cse15 |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| (store (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse6)) .cse1)) .cse0)))) is different from false [2023-11-24 08:18:33,463 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|) (forall ((v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select .cse0 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse1 (store (select (store .cse0 |c_~#value~0.base| (store (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse2 (store .cse0 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse1))) (store .cse2 |c_~#value~0.base| (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_61 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (forall ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (forall ((v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (or (< 0 (mod (select v_DerPreprocessor_61 v_prenex_47) 4294967296)) (< 0 (mod (select (select (let ((.cse4 (store (select (store .cse3 |c_~#value~0.base| (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_46)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse4) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse5 (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse4))) (store .cse5 |c_~#value~0.base| (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_45))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_47 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) is different from false [2023-11-24 08:18:38,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:18:38,825 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 2 case distinctions, treesize of input 29642 treesize of output 27155 [2023-11-24 08:18:38,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 08:18:38,929 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 60 treesize of output 58 [2023-11-24 08:18:39,028 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 08:18:39,029 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 137 treesize of output 129 [2023-11-24 08:18:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 28 refuted. 2 times theorem prover too weak. 2 trivial. 10 not checked. [2023-11-24 08:18:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155763985] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:18:41,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 08:18:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 20] total 53 [2023-11-24 08:18:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424149467] [2023-11-24 08:18:41,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 08:18:41,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-24 08:18:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:18:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-24 08:18:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2218, Unknown=35, NotChecked=198, Total=2756 [2023-11-24 08:18:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:18:41,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:18:41,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 53 states have internal predecessors, (151), 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-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-24 08:18:41,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:18:57,654 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (.cse12 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse10 (not .cse9))) (and (forall ((v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< 0 (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store .cse0 |c_~#value~0.base| (store (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or (not .cse2) (forall ((v_prenex_45 Int) (v_prenex_47 Int) (v_DerPreprocessor_61 (Array Int Int)) (v_prenex_46 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select (let ((.cse3 (store (select (store .cse5 |c_~#value~0.base| (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_46)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse3) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse4 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse3))) (store .cse4 |c_~#value~0.base| (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_45))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_47 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_61 v_prenex_47) 4294967296)))))) (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (or .cse2 (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_subst_16 Int) (v_ArrVal_1056 Int) (v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_62) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select (let ((.cse6 (store (select (store .cse8 |c_~#value~0.base| (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| v_subst_16)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse7 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6))) (store .cse7 |c_~#value~0.base| (store (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_61 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse9) (or (and (or .cse10 (forall ((v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (let ((.cse11 (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_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (mod (select (select (store .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| (store (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (or .cse9 (forall ((v_ArrVal_1056 Int) (v_DerPreprocessor_55 (Array Int Int))) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (not .cse12)) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (forall ((v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_55 (Array Int Int))) (< 0 (mod (select (select (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store (store .cse13 |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| (store (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse9) (or .cse9 (forall ((v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse15 (store (select (store .cse14 |c_~#value~0.base| (store (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base| v_DerPreprocessor_55) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse16 (store .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15))) (store .cse16 |c_~#value~0.base| (store (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_1056))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_61 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse2 (forall ((v_DerPreprocessor_65 (Array Int Int)) (v_prenex_45 Int) (v_prenex_47 Int) (v_DerPreprocessor_61 (Array Int Int)) (v_prenex_46 Int)) (let ((.cse17 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_65) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_61 v_prenex_47) 4294967296)) (< 0 (mod (select (select (let ((.cse18 (store (select (store .cse17 |c_~#value~0.base| (store (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_46)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse19 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse18))) (store .cse19 |c_~#value~0.base| (store (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_45))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_47 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (or .cse12 (and (or (forall ((v_ArrVal_1056 Int) (v_DerPreprocessor_58 (Array Int Int))) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_58) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse9) (or .cse10 (forall ((v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_1056 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (let ((.cse20 (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_1056)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store (store .cse20 |c_~#value~0.base| v_DerPreprocessor_53) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse20 |c_~#value~0.base| (store (select .cse20 |c_~#value~0.base|) |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (forall ((v_DerPreprocessor_61 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (or (< 0 (mod (select (select .cse21 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (forall ((v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (or (< 0 (mod (select v_DerPreprocessor_61 v_prenex_47) 4294967296)) (< 0 (mod (select (select (let ((.cse22 (store (select (store .cse21 |c_~#value~0.base| (store (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_46)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (let ((.cse23 (store .cse21 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22))) (store .cse23 |c_~#value~0.base| (store (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_45))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_47 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))))) is different from false Killed by 15