./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/08_rand_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/08_rand_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 07:26:17,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 07:26:17,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-13 07:26:17,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 07:26:17,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 07:26:17,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 07:26:17,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 07:26:17,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 07:26:17,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 07:26:17,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 07:26:17,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 07:26:17,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 07:26:17,986 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 07:26:17,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 07:26:17,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 07:26:17,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 07:26:17,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 07:26:17,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 07:26:17,988 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 07:26:17,989 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 07:26:17,989 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 07:26:17,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 07:26:17,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 07:26:17,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 07:26:17,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 07:26:17,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 07:26:17,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 07:26:17,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 07:26:17,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 07:26:17,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 07:26:17,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 07:26:17,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 07:26:17,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 07:26:17,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 07:26:17,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 07:26:17,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 07:26:17,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 07:26:17,994 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 07:26:17,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 07:26:17,994 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 07:26:17,995 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 07:26:17,995 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c [2024-11-13 07:26:18,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 07:26:18,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 07:26:18,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 07:26:18,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 07:26:18,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 07:26:18,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-ext/08_rand_cas.i [2024-11-13 07:26:19,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 07:26:19,599 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 07:26:19,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/08_rand_cas.i [2024-11-13 07:26:19,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/044203caa/cdfa27f8c04f4366bcf6512484c07a9a/FLAG8d0f1e094 [2024-11-13 07:26:19,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/044203caa/cdfa27f8c04f4366bcf6512484c07a9a [2024-11-13 07:26:19,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 07:26:19,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 07:26:19,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 07:26:19,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 07:26:19,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 07:26:19,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 07:26:19" (1/1) ... [2024-11-13 07:26:19,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b167ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:19, skipping insertion in model container [2024-11-13 07:26:19,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 07:26:19" (1/1) ... [2024-11-13 07:26:20,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 07:26:20,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 07:26:20,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 07:26:20,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 07:26:20,393 INFO L204 MainTranslator]: Completed translation [2024-11-13 07:26:20,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20 WrapperNode [2024-11-13 07:26:20,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 07:26:20,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 07:26:20,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 07:26:20,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 07:26:20,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,441 INFO L138 Inliner]: procedures = 178, calls = 38, calls flagged for inlining = 16, calls inlined = 17, statements flattened = 151 [2024-11-13 07:26:20,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 07:26:20,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 07:26:20,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 07:26:20,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 07:26:20,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 07:26:20,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 07:26:20,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 07:26:20,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 07:26:20,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (1/1) ... [2024-11-13 07:26:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 07:26:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:20,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 07:26:20,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 07:26:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 07:26:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-13 07:26:20,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-13 07:26:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 07:26:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 07:26:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 07:26:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 07:26:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 07:26:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 07:26:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 07:26:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 07:26:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 07:26:20,547 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 07:26:20,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 07:26:20,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 07:26:20,901 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 07:26:20,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 07:26:21,092 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 07:26:21,092 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 07:26:21,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 07:26:21 BoogieIcfgContainer [2024-11-13 07:26:21,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 07:26:21,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 07:26:21,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 07:26:21,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 07:26:21,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 07:26:19" (1/3) ... [2024-11-13 07:26:21,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333270a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 07:26:21, skipping insertion in model container [2024-11-13 07:26:21,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:26:20" (2/3) ... [2024-11-13 07:26:21,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333270a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 07:26:21, skipping insertion in model container [2024-11-13 07:26:21,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 07:26:21" (3/3) ... [2024-11-13 07:26:21,101 INFO L112 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2024-11-13 07:26:21,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 07:26:21,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-13 07:26:21,116 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 07:26:21,190 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 07:26:21,236 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:21,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 07:26:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:21,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 07:26:21,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 07:26:21,266 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 07:26:21,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-11-13 07:26:21,279 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3a004626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:21,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-13 07:26:21,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:21,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1564466095, now seen corresponding path program 1 times [2024-11-13 07:26:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295992578] [2024-11-13 07:26:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:26:21,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:21,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295992578] [2024-11-13 07:26:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295992578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 07:26:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486674529] [2024-11-13 07:26:21,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:21,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:21,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:21,794 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:21,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:21,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:21,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 07:26:21,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:21,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1564466096, now seen corresponding path program 1 times [2024-11-13 07:26:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757878257] [2024-11-13 07:26:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:26:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757878257] [2024-11-13 07:26:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757878257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:22,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:22,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 07:26:22,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189070286] [2024-11-13 07:26:22,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:22,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:22,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:22,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:22,026 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:22,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:22,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 07:26:22,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:22,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1299001168, now seen corresponding path program 1 times [2024-11-13 07:26:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131383282] [2024-11-13 07:26:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:26:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131383282] [2024-11-13 07:26:22,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131383282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:22,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:22,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:26:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958611122] [2024-11-13 07:26:22,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:22,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 07:26:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 07:26:22,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 07:26:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:22,266 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:22,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:22,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:26:22,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 07:26:22,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:22,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1618960005, now seen corresponding path program 1 times [2024-11-13 07:26:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:22,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923384232] [2024-11-13 07:26:22,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:26:22,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923384232] [2024-11-13 07:26:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923384232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:22,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:22,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:26:22,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855840257] [2024-11-13 07:26:22,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:22,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 07:26:22,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:22,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 07:26:22,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 07:26:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:22,745 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:22,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:22,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:26:22,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:26:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:26:22,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 19 remaining) [2024-11-13 07:26:22,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2024-11-13 07:26:22,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2024-11-13 07:26:22,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2024-11-13 07:26:22,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2024-11-13 07:26:22,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2024-11-13 07:26:22,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONMEMORY_LEAK (12 of 19 remaining) [2024-11-13 07:26:22,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (11 of 19 remaining) [2024-11-13 07:26:22,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2024-11-13 07:26:22,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2024-11-13 07:26:22,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2024-11-13 07:26:22,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2024-11-13 07:26:22,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONMEMORY_LEAK (0 of 19 remaining) [2024-11-13 07:26:22,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 07:26:22,917 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 07:26:22,922 INFO L317 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-11-13 07:26:22,926 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:22,928 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 07:26:22,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 07:26:22,929 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3a004626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:22,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 07:26:22,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 07:26:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1896579585, now seen corresponding path program 1 times [2024-11-13 07:26:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381620118] [2024-11-13 07:26:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 07:26:22,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 07:26:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 07:26:23,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 07:26:23,013 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 07:26:23,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 07:26:23,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-13 07:26:23,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 07:26:23,015 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 07:26:23,016 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-11-13 07:26:23,016 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 07:26:23,016 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 07:26:23,058 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 07:26:23,060 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:23,061 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 07:26:23,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 07:26:23,063 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3a004626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:23,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 07:26:23,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 07:26:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash -572451316, now seen corresponding path program 1 times [2024-11-13 07:26:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177987759] [2024-11-13 07:26:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 07:26:23,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 07:26:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 07:26:23,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 07:26:23,190 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 07:26:23,190 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 07:26:23,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-13 07:26:23,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 07:26:23,192 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 07:26:23,192 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/3) [2024-11-13 07:26:23,192 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 07:26:23,192 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-13 07:26:23,230 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 07:26:23,232 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:23,233 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 07:26:23,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-11-13 07:26:23,233 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3a004626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:26:23,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-13 07:26:23,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-13 07:26:23,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-13 07:26:23,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-13 07:26:23,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-13 07:26:23,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2098787068, now seen corresponding path program 1 times [2024-11-13 07:26:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:23,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490188179] [2024-11-13 07:26:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 07:26:23,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:23,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490188179] [2024-11-13 07:26:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490188179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:23,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:23,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 07:26:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099117866] [2024-11-13 07:26:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:23,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:23,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-13 07:26:23,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:23,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 07:26:23,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2098787067, now seen corresponding path program 1 times [2024-11-13 07:26:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044842562] [2024-11-13 07:26:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 07:26:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044842562] [2024-11-13 07:26:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044842562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 07:26:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671567066] [2024-11-13 07:26:23,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:23,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:23,774 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-13 07:26:23,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:23,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:24,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 07:26:24,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:24,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1937333044, now seen corresponding path program 1 times [2024-11-13 07:26:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311432231] [2024-11-13 07:26:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 07:26:24,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311432231] [2024-11-13 07:26:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311432231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:24,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:24,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:26:24,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583048585] [2024-11-13 07:26:24,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 07:26:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 07:26:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 07:26:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:24,158 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:24,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:24,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:24,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:24,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:29,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 07:26:29,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:29,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1244766131, now seen corresponding path program 1 times [2024-11-13 07:26:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782183354] [2024-11-13 07:26:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 07:26:29,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782183354] [2024-11-13 07:26:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782183354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 07:26:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146707366] [2024-11-13 07:26:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 07:26:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 07:26:29,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 07:26:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:29,684 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:29,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:29,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:29,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:29,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:29,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:30,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 07:26:30,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1967748194, now seen corresponding path program 1 times [2024-11-13 07:26:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:30,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624690532] [2024-11-13 07:26:30,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 07:26:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624690532] [2024-11-13 07:26:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624690532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:30,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:30,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:26:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226294750] [2024-11-13 07:26:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:30,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 07:26:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 07:26:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 07:26:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:30,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:30,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:31,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 07:26:31,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:31,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -734418417, now seen corresponding path program 1 times [2024-11-13 07:26:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:31,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988388715] [2024-11-13 07:26:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 07:26:31,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988388715] [2024-11-13 07:26:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988388715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:31,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:26:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838307162] [2024-11-13 07:26:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:31,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:31,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:31,551 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:31,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:31,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:31,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:31,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:31,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:31,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 07:26:34,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:34,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -801425170, now seen corresponding path program 1 times [2024-11-13 07:26:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:34,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42365131] [2024-11-13 07:26:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 07:26:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:34,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42365131] [2024-11-13 07:26:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42365131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:34,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:26:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278688847] [2024-11-13 07:26:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:34,861 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:34,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:34,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:34,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:34,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:34,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:34,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:34,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:34,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 07:26:37,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -800501649, now seen corresponding path program 1 times [2024-11-13 07:26:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060102889] [2024-11-13 07:26:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 07:26:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:37,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060102889] [2024-11-13 07:26:37,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060102889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:37,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:37,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:26:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656864809] [2024-11-13 07:26:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:37,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:37,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:37,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:37,799 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:37,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 07:26:40,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1250776790, now seen corresponding path program 1 times [2024-11-13 07:26:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131134827] [2024-11-13 07:26:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 07:26:40,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131134827] [2024-11-13 07:26:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131134827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 07:26:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033005793] [2024-11-13 07:26:40,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:26:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:26:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:26:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:40,709 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:40,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:40,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 07:26:43,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1626763766, now seen corresponding path program 1 times [2024-11-13 07:26:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142238152] [2024-11-13 07:26:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 07:26:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142238152] [2024-11-13 07:26:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142238152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315772973] [2024-11-13 07:26:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:43,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:26:43,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 07:26:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:44,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 07:26:44,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:26:44,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:26:44,077 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 [2024-11-13 07:26:44,115 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 [2024-11-13 07:26:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 07:26:44,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:26:44,168 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 6 treesize of output 4 [2024-11-13 07:26:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 07:26:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315772973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:26:44,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:26:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 6 [2024-11-13 07:26:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626707780] [2024-11-13 07:26:44,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:26:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 07:26:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 07:26:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 07:26:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:44,193 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.833333333333334) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:44,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:44,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 07:26:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 07:26:44,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1251700311, now seen corresponding path program 1 times [2024-11-13 07:26:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253978240] [2024-11-13 07:26:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 07:26:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253978240] [2024-11-13 07:26:44,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253978240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:44,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449630412] [2024-11-13 07:26:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:44,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:44,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:44,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:26:44,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 07:26:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:45,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 07:26:45,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:26:45,088 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:26:45,089 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 [2024-11-13 07:26:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 [2024-11-13 07:26:45,129 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 17 treesize of output 12 [2024-11-13 07:26:45,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 07:26:45,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:26:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 07:26:45,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:26:45,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:26:45,177 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 88 treesize of output 91 [2024-11-13 07:26:45,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:26:45,187 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 82 treesize of output 85 [2024-11-13 07:26:45,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:26:45,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-13 07:26:45,400 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 32 treesize of output 24 [2024-11-13 07:26:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 07:26:45,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449630412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:26:45,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:26:45,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2024-11-13 07:26:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286024646] [2024-11-13 07:26:45,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:26:45,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 07:26:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 07:26:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=221, Unknown=3, NotChecked=0, Total=272 [2024-11-13 07:26:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:45,436 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:45,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 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) [2024-11-13 07:26:45,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:45,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:49,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 07:26:49,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 07:26:49,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:49,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 923066059, now seen corresponding path program 1 times [2024-11-13 07:26:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:49,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846905090] [2024-11-13 07:26:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 07:26:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846905090] [2024-11-13 07:26:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846905090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403918082] [2024-11-13 07:26:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:49,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:49,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:26:49,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 07:26:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:49,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 07:26:49,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:26:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 07:26:49,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:26:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 07:26:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403918082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:26:49,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:26:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-13 07:26:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520517320] [2024-11-13 07:26:49,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:26:49,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 07:26:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:49,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 07:26:49,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 07:26:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:49,888 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:49,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:49,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:50,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 07:26:50,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 07:26:50,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:50,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1743909438, now seen corresponding path program 1 times [2024-11-13 07:26:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:50,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366720850] [2024-11-13 07:26:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 07:26:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:50,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366720850] [2024-11-13 07:26:50,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366720850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:50,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:50,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:26:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349829516] [2024-11-13 07:26:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:50,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:26:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:26:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:26:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:50,574 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:50,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:50,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:50,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 07:26:53,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 521186963, now seen corresponding path program 1 times [2024-11-13 07:26:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:53,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797621672] [2024-11-13 07:26:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 07:26:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797621672] [2024-11-13 07:26:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797621672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:26:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:26:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:26:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129300001] [2024-11-13 07:26:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 07:26:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 07:26:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 07:26:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:53,733 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:53,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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) [2024-11-13 07:26:53,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:53,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:53,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:55,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 07:26:55,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:55,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash 616935, now seen corresponding path program 1 times [2024-11-13 07:26:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591844596] [2024-11-13 07:26:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 07:26:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591844596] [2024-11-13 07:26:55,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591844596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021961948] [2024-11-13 07:26:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:55,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:26:55,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 07:26:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:55,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 07:26:55,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:26:55,628 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:26:55,629 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 [2024-11-13 07:26:55,692 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 [2024-11-13 07:26:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 07:26:55,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:26:55,738 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 6 treesize of output 4 [2024-11-13 07:26:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 07:26:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021961948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:26:55,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:26:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 4] total 10 [2024-11-13 07:26:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032047511] [2024-11-13 07:26:55,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:26:55,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 07:26:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 07:26:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-13 07:26:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:55,766 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:55,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:55,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:55,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:55,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:55,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:56,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 07:26:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-13 07:26:56,320 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:56,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1845671533, now seen corresponding path program 1 times [2024-11-13 07:26:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163817439] [2024-11-13 07:26:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 07:26:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163817439] [2024-11-13 07:26:56,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163817439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790786444] [2024-11-13 07:26:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:56,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:26:56,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 07:26:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:56,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 07:26:56,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:26:56,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:26:56,764 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 [2024-11-13 07:26:56,839 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 [2024-11-13 07:26:56,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:26:56,860 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 [2024-11-13 07:26:56,925 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 [2024-11-13 07:26:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 07:26:56,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:26:56,975 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 6 treesize of output 4 [2024-11-13 07:26:57,032 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 6 treesize of output 4 [2024-11-13 07:26:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 07:26:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790786444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:26:57,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:26:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-13 07:26:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433684169] [2024-11-13 07:26:57,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:26:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 07:26:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 07:26:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-13 07:26:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:57,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:57,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 9.055555555555555) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:57,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:57,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:57,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:26:57,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 07:26:57,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:57,761 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:26:57,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:26:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1232242254, now seen corresponding path program 1 times [2024-11-13 07:26:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:26:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805890146] [2024-11-13 07:26:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:26:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 07:26:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:26:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805890146] [2024-11-13 07:26:58,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805890146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:58,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319013558] [2024-11-13 07:26:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:26:58,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:26:58,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:26:58,064 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) [2024-11-13 07:26:58,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 07:26:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:26:58,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 07:26:58,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:26:58,402 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 [2024-11-13 07:26:58,403 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 [2024-11-13 07:26:58,408 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 [2024-11-13 07:26:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2024-11-13 07:26:58,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:26:58,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:26:58,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:26:58,452 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 49 treesize of output 37 [2024-11-13 07:26:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 07:26:58,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:26:58,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:26:58,484 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 101 treesize of output 104 [2024-11-13 07:26:58,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:26:58,492 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 95 treesize of output 98 [2024-11-13 07:26:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 07:26:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319013558] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 07:26:58,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 07:26:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 11] total 23 [2024-11-13 07:26:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768476360] [2024-11-13 07:26:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:26:58,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 07:26:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:26:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 07:26:58,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-11-13 07:26:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:26:58,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:26:58,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:58,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:58,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:26:58,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 07:26:58,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:58,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:26:58,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:26:58,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:26:58,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:26:58,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:02,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 07:27:02,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 07:27:02,897 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:27:02,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:27:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1807653842, now seen corresponding path program 1 times [2024-11-13 07:27:02,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:27:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153102321] [2024-11-13 07:27:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:27:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:27:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:27:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 07:27:03,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:27:03,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153102321] [2024-11-13 07:27:03,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153102321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:27:03,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637849141] [2024-11-13 07:27:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:27:03,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:27:03,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:27:03,108 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) [2024-11-13 07:27:03,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 07:27:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:27:03,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 07:27:03,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:27:03,285 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:27:03,285 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 [2024-11-13 07:27:03,337 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 [2024-11-13 07:27:03,341 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 [2024-11-13 07:27:03,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 07:27:03,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:27:03,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:27:03,469 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 17 treesize of output 12 [2024-11-13 07:27:03,470 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 [2024-11-13 07:27:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 07:27:03,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:27:04,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:04,188 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 96 treesize of output 99 [2024-11-13 07:27:04,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:04,195 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 90 treesize of output 93 [2024-11-13 07:27:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 22 refuted. 18 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 07:27:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637849141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:27:04,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:27:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2024-11-13 07:27:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107039157] [2024-11-13 07:27:04,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:27:04,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 07:27:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:27:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 07:27:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=212, Unknown=9, NotChecked=0, Total=272 [2024-11-13 07:27:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:04,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:27:04,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:04,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:04,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:06,843 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] [2024-11-13 07:27:08,949 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] [2024-11-13 07:27:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:27:09,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 07:27:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:27:09,739 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:27:09,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:27:09,739 INFO L85 PathProgramCache]: Analyzing trace with hash 963181971, now seen corresponding path program 1 times [2024-11-13 07:27:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:27:09,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239330482] [2024-11-13 07:27:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:27:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:27:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:27:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:27:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:27:10,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239330482] [2024-11-13 07:27:10,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239330482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:27:10,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562472789] [2024-11-13 07:27:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:27:10,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:27:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:27:10,035 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) [2024-11-13 07:27:10,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 07:27:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:27:10,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 07:27:10,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:27:10,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:27:10,217 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 [2024-11-13 07:27:10,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-13 07:27:10,389 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 17 treesize of output 12 [2024-11-13 07:27:10,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:27:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 07:27:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 07:27:10,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:27:10,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:10,452 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 88 treesize of output 91 [2024-11-13 07:27:10,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:10,462 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 82 treesize of output 85 [2024-11-13 07:27:10,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:10,660 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-13 07:27:10,662 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 32 treesize of output 24 [2024-11-13 07:27:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 07:27:10,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562472789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:27:10,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:27:10,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2024-11-13 07:27:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217125511] [2024-11-13 07:27:10,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:27:10,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 07:27:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:27:10,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 07:27:10,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=422, Unknown=6, NotChecked=0, Total=506 [2024-11-13 07:27:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:10,714 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:27:10,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.565217391304348) internal successors, (197), 23 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:27:10,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:27:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:27:15,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 07:27:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 07:27:15,620 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:27:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:27:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -785538344, now seen corresponding path program 1 times [2024-11-13 07:27:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:27:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475193717] [2024-11-13 07:27:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:27:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:27:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:27:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 07:27:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:27:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475193717] [2024-11-13 07:27:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475193717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:27:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:27:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:27:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469079369] [2024-11-13 07:27:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:27:15,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 07:27:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:27:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 07:27:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 07:27:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:15,721 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:27:15,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:27:15,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:27:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 07:27:17,676 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:27:17,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:27:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 534940896, now seen corresponding path program 2 times [2024-11-13 07:27:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:27:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298551260] [2024-11-13 07:27:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:27:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:27:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:27:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:27:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:27:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298551260] [2024-11-13 07:27:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298551260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:27:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179082747] [2024-11-13 07:27:18,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 07:27:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:27:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:27:18,070 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) [2024-11-13 07:27:18,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 07:27:18,186 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 07:27:18,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:27:18,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 07:27:18,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:27:18,247 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 [2024-11-13 07:27:18,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:27:18,329 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 [2024-11-13 07:27:18,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:27:18,558 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 [2024-11-13 07:27:18,666 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-13 07:27:18,671 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 25 treesize of output 18 [2024-11-13 07:27:18,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:27:18,922 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 25 treesize of output 18 [2024-11-13 07:27:18,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:18,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-13 07:27:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:27:18,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:27:19,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:19,007 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 83 treesize of output 86 [2024-11-13 07:27:19,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:19,548 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 88 treesize of output 91 [2024-11-13 07:27:19,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:19,567 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 167 treesize of output 179 [2024-11-13 07:27:20,914 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 6 treesize of output 4 [2024-11-13 07:27:20,934 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 6 treesize of output 4 [2024-11-13 07:27:23,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:23,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 264 treesize of output 334 [2024-11-13 07:27:30,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:27:30,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 114 treesize of output 116 [2024-11-13 07:27:30,427 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2024-11-13 07:27:30,429 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 85 treesize of output 81 [2024-11-13 07:27:30,430 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 81 treesize of output 79 [2024-11-13 07:27:30,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2024-11-13 07:27:30,434 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 130 treesize of output 114 [2024-11-13 07:27:30,436 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 58 treesize of output 56 [2024-11-13 07:27:30,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:27:30,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:27:30,445 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:27:30,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-11-13 07:27:30,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:27:30,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:27:30,450 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:27:30,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-11-13 07:27:30,455 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:27:30,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2024-11-13 07:27:30,460 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 07:27:30,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 114 treesize of output 1 [2024-11-13 07:27:30,465 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 07:27:30,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 114 treesize of output 1 [2024-11-13 07:27:30,469 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:27:30,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2024-11-13 07:27:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 38 refuted. 5 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:27:30,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179082747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:27:30,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:27:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-13 07:27:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527689462] [2024-11-13 07:27:30,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:27:30,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 07:27:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:27:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 07:27:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1202, Unknown=26, NotChecked=0, Total=1406 [2024-11-13 07:27:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:30,483 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:27:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.552631578947368) internal successors, (211), 38 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:27:30,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:27:42,110 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] [2024-11-13 07:27:44,732 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] [2024-11-13 07:27:54,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (= (select |c_#valid| 3) 1) (<= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 1)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (let ((.cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|))) (and (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse2)) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse2))) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1))) is different from false [2024-11-13 07:28:14,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 1)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (let ((.cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|))) (and (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse2)) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse2))) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1))) is different from false [2024-11-13 07:28:15,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (.cse6 (= .cse8 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse5)) (.cse7 (not (= .cse8 0)))) (let ((.cse0 (select |c_#valid| |c_~#seed~0.base|)) (.cse1 (and .cse3 .cse4 .cse7)) (.cse2 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (not (= .cse0 0)) (or (not (= .cse0 1)) .cse1) (or .cse1 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= c_~state~0 1) (or .cse2 (< |c_~#seed~0.offset| 0) .cse3 (and (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse4) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse5)) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (or .cse2 .cse6 (forall ((v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) .cse7))))) is different from false [2024-11-13 07:28:18,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse1 (select .cse2 |c_~#seed~0.offset|))) (let ((.cse8 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (.cse9 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse1))) (let ((.cse6 (forall ((v_prenex_7 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_prenex_9 Int)) (or (= |c_~#seed~0.base| v_prenex_7) (= v_prenex_9 0) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| v_prenex_9)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)) (= .cse1 v_prenex_9) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base| v_DerPreprocessor_11) v_prenex_7 v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (.cse11 (not .cse9)) (.cse17 (not .cse8)) (.cse13 (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|))) (.cse7 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|)) (.cse5 (forall ((v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| v_prenex_5)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_prenex_6))) (or (not (= (select (select (store .cse24 v_prenex_4 v_prenex_8) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= v_prenex_5 0) (= .cse1 v_prenex_5) (= |c_~#seed~0.base| v_prenex_4) (= .cse1 (select (select .cse24 |c_~#seed~0.base|) |c_~#seed~0.offset|)))))) (.cse21 (forall ((v_prenex_7 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_prenex_9 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (= |c_~#seed~0.base| v_prenex_7) (= v_prenex_9 0) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| v_prenex_9)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)) (= .cse1 v_prenex_9) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base| v_DerPreprocessor_11) v_prenex_7 v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (.cse0 (< |c_~#seed~0.offset| 0))) (and (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (|thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (= .cse1 |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= .cse1 (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (= |c_~#seed~0.base| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|) (not (= 0 (select |c_#valid| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#seed~0.base| v_DerPreprocessor_11) |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0)))) (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (or (forall ((|v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (|thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_18))) (or (= .cse1 |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store .cse3 |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_~#seed~0.base| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|) (not (= 0 (select |c_#valid| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|))) (= |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (= (select (select .cse3 |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)))) .cse0) (or .cse0 (and (forall ((|thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (= .cse1 |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|) (= |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (forall ((|v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| Int)) (or (forall ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14))) (or (not (= (select (select (store .cse4 |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= (select (select .cse4 |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)))) (not (= 0 (select |c_#valid| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|))))))) (or (forall ((|thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_14 (Array Int Int))) (or (= .cse1 |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)) (= |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0))) (not (= (select |c_#valid| |c_~#seed~0.base|) 0))) (forall ((|thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (= .cse1 |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|) (forall ((|v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| Int)) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base| v_DerPreprocessor_11) |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= |c_~#seed~0.base| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|) (not (= 0 (select |c_#valid| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|))))) (= |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0))))) (<= (+ |c_~#seed~0.offset| 4) (select |c_#length| 3)) (= c_~state~0 1) (or (and .cse5 .cse6) .cse0) (or .cse5 .cse0) (not (= .cse7 0)) (or (forall ((v_prenex_13 Int) (v_DerPreprocessor_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= .cse1 v_prenex_13) (= |c_~#seed~0.base| v_prenex_10) (= v_prenex_13 0) (not (= .cse1 (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| v_prenex_13)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#seed~0.base| v_prenex_11) v_prenex_10 v_prenex_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) .cse0) (or .cse8 (and (or .cse9 (forall ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_17))) (or (= (select (select .cse10 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse10 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse11 .cse0 (forall ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse12 (store .cse13 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_18))) (or (= (select (select .cse12 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse12 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse0 (and (or .cse11 (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store .cse13 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_16) |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_15))) (or (not (= (select (select .cse14 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (not (= (select (select (store (store .cse14 |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) .cse9))))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (or .cse0 .cse6) (or .cse9 (and (forall ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_13))) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse15 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse15 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or .cse0 (and (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_13))) (or (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse16 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse16 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) .cse17) (or .cse8 (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_13))) (or (not (= (select (select (store (store .cse18 |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse18 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (exists ((|thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int)) (and (<= 4 (select |c_#length| |thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= 3 |thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)))) (or .cse11 .cse0 (and (forall ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (store .cse13 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14))) (or (= (select (select .cse19 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse19 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or .cse17 (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (store .cse13 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14))) (or (not (= (select (select .cse20 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (not (= (select (select (store .cse20 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select (store .cse13 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_14) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) .cse8))) (not (= .cse7 1)) (or .cse0 (and .cse5 .cse21)) (or (and (forall ((v_prenex_4 Int)) (or (= |c_~#seed~0.base| v_prenex_4) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| v_prenex_5)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_prenex_6))) (or (not (= (select (select (store .cse22 v_prenex_4 v_prenex_8) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= v_prenex_5 0) (= .cse1 v_prenex_5) (= .cse1 (select (select .cse22 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) .cse21) .cse0) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (|thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (let ((.cse23 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse2 |c_~#seed~0.offset| |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_18))) (or (= .cse1 |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store .cse23 |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_~#seed~0.base| |v_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base_41|) (= |thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (= (select (select .cse23 |c_~#seed~0.base|) |c_~#seed~0.offset|) .cse1)))))))))) is different from false [2024-11-13 07:28:20,938 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] [2024-11-13 07:28:24,566 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] [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:28:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-11-13 07:28:35,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 07:28:35,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 07:28:35,259 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:28:35,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:28:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash -42815917, now seen corresponding path program 1 times [2024-11-13 07:28:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:28:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998519225] [2024-11-13 07:28:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:28:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:28:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:28:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 63 proven. 61 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 07:28:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:28:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998519225] [2024-11-13 07:28:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998519225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:28:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417741936] [2024-11-13 07:28:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:28:35,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:28:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:28:35,678 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) [2024-11-13 07:28:35,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 07:28:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:28:35,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 07:28:35,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:28:35,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:28:35,869 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 [2024-11-13 07:28:35,997 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 106 [2024-11-13 07:28:36,007 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 108 treesize of output 109 [2024-11-13 07:28:36,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2024-11-13 07:28:36,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2024-11-13 07:28:36,040 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 36 treesize of output 19 [2024-11-13 07:28:36,041 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 19 treesize of output 4 [2024-11-13 07:28:36,050 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)))) is different from true [2024-11-13 07:28:36,054 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 102 treesize of output 90 [2024-11-13 07:28:36,056 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2024-11-13 07:28:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 39 trivial. 6 not checked. [2024-11-13 07:28:36,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:28:36,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:28:36,114 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 88 treesize of output 91 [2024-11-13 07:28:36,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:28:36,121 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 82 treesize of output 85 [2024-11-13 07:28:36,332 WARN L851 $PredicateComparison]: unable to prove that (or (and (or (< |c_~#seed~0.offset| 0) (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_21 (Array Int Int))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_22) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= 0 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|)) is different from false [2024-11-13 07:28:36,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:28:36,339 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 58 treesize of output 50 [2024-11-13 07:28:36,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 6 treesize of output 4 [2024-11-13 07:28:36,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:28:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 53 proven. 31 refuted. 0 times theorem prover too weak. 48 trivial. 6 not checked. [2024-11-13 07:28:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417741936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:28:36,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:28:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 32 [2024-11-13 07:28:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097343982] [2024-11-13 07:28:36,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:28:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 07:28:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:28:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 07:28:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=763, Unknown=19, NotChecked=114, Total=992 [2024-11-13 07:28:36,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:28:36,396 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:28:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.65625) internal successors, (213), 32 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:36,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-11-13 07:28:36,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:28:39,652 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse2 (= (select .cse4 |c_~#seed~0.offset|) 0))) (let ((.cse0 (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|)) (.cse1 (not .cse2))) (and (or (and .cse0 .cse1) (and .cse2 (= 0 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|))) .cse0 (= c_~state~0 1) (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse3 (select .cse5 |c_~#seed~0.offset|))) (and (not (= .cse3 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse4 |c_~#seed~0.offset| .cse3) .cse5))))) .cse1) (and (<= 0 |c_~#seed~0.offset|) .cse1)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse1)))) is different from true [2024-11-13 07:28:40,298 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (and (= c_~state~0 1) (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse3))) is different from true [2024-11-13 07:28:40,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (and (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 0)) (= c_~state~0 1) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse3))) is different from true [2024-11-13 07:28:42,730 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (let ((.cse4 (not (= .cse0 0)))) (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 0)) (= c_~state~0 1) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (select |c_#valid| |c_~#seed~0.base|) 1) (not (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse1 (select .cse3 |c_~#seed~0.offset|))) (and (not (= .cse1 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse2 |c_~#seed~0.offset| .cse1) .cse3))))) .cse4) (and (<= 0 |c_~#seed~0.offset|) .cse4)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) .cse4)))) is different from true [2024-11-13 07:28:43,024 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (let ((.cse4 (not (= .cse0 0)))) (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 0)) (= c_~state~0 1) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (select |c_#valid| |c_~#seed~0.base|) 1) (not (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse1 (select .cse3 |c_~#seed~0.offset|))) (and (not (= .cse1 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse2 |c_~#seed~0.offset| .cse1) .cse3))))) .cse4) (and (<= 0 |c_~#seed~0.offset|) .cse4)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) .cse4)))) is different from true [2024-11-13 07:28:43,495 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (and (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse3))) is different from true [2024-11-13 07:28:43,687 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (and (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) .cse3))) is different from true [2024-11-13 07:28:48,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 1)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (let ((.cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|))) (and (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse2)) (or (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse2))) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1))) is different from false [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:28:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:28:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-11-13 07:28:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-11-13 07:28:50,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 07:28:50,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 07:28:50,740 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:28:50,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:28:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1226274460, now seen corresponding path program 1 times [2024-11-13 07:28:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:28:50,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256533529] [2024-11-13 07:28:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:28:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:28:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:28:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:28:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:28:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256533529] [2024-11-13 07:28:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256533529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:28:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217682138] [2024-11-13 07:28:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:28:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:28:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:28:51,051 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) [2024-11-13 07:28:51,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 07:28:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:28:51,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 07:28:51,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:28:51,163 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 [2024-11-13 07:28:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 07:28:51,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:28:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217682138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:28:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 07:28:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-11-13 07:28:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451284127] [2024-11-13 07:28:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:28:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:28:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:28:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:28:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-13 07:28:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:28:51,197 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:28:51,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:28:51,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 171 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2024-11-13 07:28:51,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2024-11-13 07:28:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:52,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 07:28:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 07:28:52,788 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:28:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:28:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash 245523970, now seen corresponding path program 1 times [2024-11-13 07:28:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:28:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200603292] [2024-11-13 07:28:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:28:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:28:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:28:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 07:28:53,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:28:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200603292] [2024-11-13 07:28:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200603292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:28:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636894874] [2024-11-13 07:28:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:28:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:28:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:28:53,144 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) [2024-11-13 07:28:53,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 07:28:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:28:53,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 07:28:53,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:28:53,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:28:53,384 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 [2024-11-13 07:28:53,671 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 106 [2024-11-13 07:28:53,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2024-11-13 07:28:53,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2024-11-13 07:28:53,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:28:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:28:53,700 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 30 treesize of output 1 [2024-11-13 07:28:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 73 proven. 58 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-13 07:28:53,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:28:53,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:28:53,759 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 88 treesize of output 91 [2024-11-13 07:28:53,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:28:53,766 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 82 treesize of output 85 [2024-11-13 07:28:53,858 WARN L851 $PredicateComparison]: unable to prove that (or (= 0 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (and (forall ((v_DerPreprocessor_27 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_27) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (or (< |c_~#seed~0.offset| 0) (forall ((v_DerPreprocessor_26 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_26) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:28:53,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:28:53,863 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 55 treesize of output 47 [2024-11-13 07:28:53,866 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 49 treesize of output 41 [2024-11-13 07:28:53,870 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 6 treesize of output 4 [2024-11-13 07:28:53,874 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 6 treesize of output 4 [2024-11-13 07:28:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 58 proven. 64 refuted. 0 times theorem prover too weak. 163 trivial. 9 not checked. [2024-11-13 07:28:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636894874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:28:54,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:28:54,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2024-11-13 07:28:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725510231] [2024-11-13 07:28:54,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:28:54,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 07:28:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:28:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 07:28:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=4, NotChecked=58, Total=992 [2024-11-13 07:28:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:28:54,133 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:28:54,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.125) internal successors, (260), 32 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:28:54,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 171 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:28:54,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2024-11-13 07:29:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2024-11-13 07:29:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-11-13 07:29:00,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 07:29:00,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:29:00,594 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:29:00,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:29:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2120067160, now seen corresponding path program 1 times [2024-11-13 07:29:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:29:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527880973] [2024-11-13 07:29:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:29:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:29:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:29:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:29:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:29:00,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527880973] [2024-11-13 07:29:00,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527880973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:29:00,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890890895] [2024-11-13 07:29:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:29:00,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:29:00,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:29:00,910 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) [2024-11-13 07:29:00,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 07:29:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:29:01,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 07:29:01,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:29:01,065 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 [2024-11-13 07:29:01,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:29:01,169 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 [2024-11-13 07:29:01,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:29:01,317 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 [2024-11-13 07:29:01,555 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-13 07:29:01,559 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 25 treesize of output 18 [2024-11-13 07:29:01,616 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 25 treesize of output 18 [2024-11-13 07:29:01,622 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:29:01,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2024-11-13 07:29:01,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:01,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-13 07:29:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:29:01,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:29:01,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:01,791 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 200 treesize of output 212 [2024-11-13 07:29:01,809 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-13 07:29:01,810 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 188 treesize of output 192 [2024-11-13 07:29:08,948 INFO L349 Elim1Store]: treesize reduction 5, result has 98.3 percent of original size [2024-11-13 07:29:08,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 533 treesize of output 798 [2024-11-13 07:29:10,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:10,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2024-11-13 07:29:10,147 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:29:10,149 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 39 treesize of output 27 [2024-11-13 07:29:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 5 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 07:29:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890890895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:29:10,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:29:10,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 45 [2024-11-13 07:29:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286548842] [2024-11-13 07:29:10,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:29:10,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 07:29:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:29:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 07:29:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1677, Unknown=28, NotChecked=0, Total=1980 [2024-11-13 07:29:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:29:10,164 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:29:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.0) internal successors, (180), 45 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 173 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-11-13 07:29:10,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:29:10,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:10,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:13,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:14,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 1)) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:19,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse1 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse0 (select |c_#valid| |c_~#seed~0.base|)) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (not (= .cse0 0)) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse1 .cse2 .cse3) (or .cse2 (not .cse1) (< |c_~#seed~0.offset| 0) (not (= .cse0 1)) .cse3 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse4 |c_~#seed~0.offset|) 0)) (not (= .cse4 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:20,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:20,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:22,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:24,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0 .cse1 .cse2) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 1)) (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 1) (or .cse1 (not .cse0) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse3 |c_~#seed~0.offset|) 0)) (not (= .cse3 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:25,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|)) (.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse1 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (<= 0 |c_~#seed~0.offset|) (not (= .cse0 0)) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse1 .cse2 .cse3) (not (= .cse0 1)) (or .cse2 (not .cse1) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse3 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse4 |c_~#seed~0.offset|) 0)) (not (= .cse4 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:29:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-11-13 07:29:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-13 07:29:27,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 07:29:27,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:29:27,918 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:29:27,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:29:27,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1820073519, now seen corresponding path program 2 times [2024-11-13 07:29:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:29:27,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387666625] [2024-11-13 07:29:27,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:29:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:29:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:29:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 46 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 07:29:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:29:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387666625] [2024-11-13 07:29:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387666625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:29:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150905991] [2024-11-13 07:29:28,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 07:29:28,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:29:28,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:29:28,494 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:29:28,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 07:29:28,614 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 07:29:28,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:29:28,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 07:29:28,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:29:28,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:29:28,725 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 [2024-11-13 07:29:28,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:29:28,788 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 [2024-11-13 07:29:29,094 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 07:29:29,097 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 25 treesize of output 18 [2024-11-13 07:29:29,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:29:29,268 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 17 treesize of output 12 [2024-11-13 07:29:29,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:29,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-13 07:29:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 07:29:29,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:29:29,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:29,356 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 83 treesize of output 86 [2024-11-13 07:29:29,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:29,662 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 88 treesize of output 91 [2024-11-13 07:29:29,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:29,679 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 162 treesize of output 174 [2024-11-13 07:29:33,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:29:33,195 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 36 [2024-11-13 07:29:33,196 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 64 treesize of output 56 [2024-11-13 07:29:33,200 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 6 treesize of output 4 [2024-11-13 07:29:33,203 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 6 treesize of output 4 [2024-11-13 07:29:33,204 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 6 treesize of output 4 [2024-11-13 07:29:33,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:29:33,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:29:33,212 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:29:33,212 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 07:29:33,216 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:29:33,216 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2024-11-13 07:29:33,221 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:29:33,221 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2024-11-13 07:29:33,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:29:33,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:29:33,227 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:29:33,227 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 07:29:33,230 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:29:33,230 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 1 [2024-11-13 07:29:33,585 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 07:29:33,585 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 13 treesize of output 12 [2024-11-13 07:29:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 52 refuted. 8 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 07:29:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150905991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:29:33,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:29:33,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 17] total 49 [2024-11-13 07:29:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079715708] [2024-11-13 07:29:33,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:29:33,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 07:29:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:29:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 07:29:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2082, Unknown=27, NotChecked=0, Total=2352 [2024-11-13 07:29:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:29:33,824 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:29:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.346938775510204) internal successors, (262), 49 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:29:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 176 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 148 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-11-13 07:29:33,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:29:37,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:29:39,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:29:39,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (let ((.cse0 (not .cse2)) (.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) .cse0)) (or .cse1 (< |c_~#seed~0.offset| 0) .cse0 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) is different from false [2024-11-13 07:29:40,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse1 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse2 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse3 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) .cse1) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse2 (< |c_~#seed~0.offset| 0) (not .cse3) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) .cse0 .cse1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse2 .cse3 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:29:40,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse1 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse2 (not .cse4)) (.cse3 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) .cse1) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 .cse1 (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) .cse2)) (or .cse3 (< |c_~#seed~0.offset| 0) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse3 .cse4 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) is different from false [2024-11-13 07:29:41,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)))) is different from false [2024-11-13 07:29:42,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:29:42,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:29:44,611 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] [2024-11-13 07:29:44,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse26 (select .cse28 |c_~#seed~0.offset|))) (let ((.cse10 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse26))) (let ((.cse1 (not .cse10)) (.cse19 (store |c_#memory_int| |c_~#seed~0.base| (store .cse28 |c_~#seed~0.offset| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)))) (let ((.cse0 (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse27 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_50))) (or (= (select (select .cse27 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse27 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (.cse3 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse4 (= .cse26 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse2 (< |c_~#seed~0.offset| 0)) (.cse8 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))) (.cse9 (forall ((v_DerPreprocessor_45 (Array Int Int))) (let ((.cse25 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_45))) (or (not (= (select (select .cse25 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store .cse25 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) (.cse11 (forall ((v_DerPreprocessor_44 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_44))) (or (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store .cse24 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse24 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (.cse12 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_44))) (or (not (= (select (select (store (store .cse23 |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse23 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (.cse7 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse5 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (.cse14 (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_46) |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_46) |c_~#seed~0.base|) |c_~#seed~0.offset|))))) .cse1)) (.cse15 (or .cse10 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_47))) (or (not (= (select (select (store (store .cse22 |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select .cse22 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))))) (.cse6 (or .cse10 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_49))) (or (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse21 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse21 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) (.cse13 (or .cse1 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int))) (let ((.cse20 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_48))) (or (not (= (select (select (store .cse20 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select .cse20 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))))))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 .cse1 .cse2) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse3 .cse2 (not .cse4) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse5) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse5 (and (or .cse0 .cse1 .cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse2 (and .cse6 (or .cse7 (and (or (and .cse8 .cse9) .cse1) (or .cse10 (and .cse11 .cse12)))) .cse13 .cse14 .cse15)))) (or (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_51))) (or (= (select (select .cse16 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= 0 (select (select (store .cse16 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|)))))) .cse10) (or (and (or .cse10 (forall ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_53))) (or (not (= (select (select (store .cse17 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= (select (select .cse17 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))) (or .cse1 .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse18 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_52))) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse18 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse18 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) .cse7) (or .cse3 .cse4 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or .cse2 (and (or (and (or .cse1 (and (or .cse5 .cse8) .cse9)) (or .cse10 (and .cse11 (or .cse5 .cse12)))) .cse7) (or .cse5 (and .cse14 .cse15)) .cse6 .cse13)))))))) is different from false [2024-11-13 07:29:46,646 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] [2024-11-13 07:29:51,911 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] [2024-11-13 07:29:54,091 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] [2024-11-13 07:29:55,300 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (let ((.cse1 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse6)) (.cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse3 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse4 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse5 (= .cse6 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (or (and .cse1 .cse2 (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|))) .cse3) (not (= .cse0 0)) (or .cse4 (< |c_~#seed~0.offset| 0) (not .cse5) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or (and .cse1 (not (= .cse6 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) .cse2) .cse3) (or .cse4 .cse5 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) is different from false [2024-11-13 07:29:55,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (let ((.cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse1)) (.cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse3 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse5 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse6 (= .cse1 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse4 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (or (and .cse0 (not (= .cse1 |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) .cse2) .cse3) (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (or (and .cse0 (= .cse1 |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) .cse2) .cse3) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) (not (= .cse4 0)) (or .cse5 (< |c_~#seed~0.offset| 0) (not .cse6) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse5 .cse6 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= .cse4 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) is different from false [2024-11-13 07:29:55,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (let ((.cse2 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse3 (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse1 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (or (and (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse0) (= .cse0 |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse1 0)) (or .cse2 (< |c_~#seed~0.offset| 0) (not .cse3) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse2 .cse3 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= .cse1 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) is different from false [2024-11-13 07:29:56,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (let ((.cse2 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse3 (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse1 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (or (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (and (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse0) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse1 0)) (or .cse2 (< |c_~#seed~0.offset| 0) (not .cse3) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse2 .cse3 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= .cse1 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) is different from false [2024-11-13 07:29:56,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:29:56,216 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:29:56,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:29:58,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:29:59,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)))) is different from false [2024-11-13 07:30:00,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:30:00,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (let ((.cse0 (not .cse2)) (.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) .cse0)) (or .cse1 (< |c_~#seed~0.offset| 0) .cse0 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) is different from false [2024-11-13 07:30:00,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse1 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse2 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse3 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) .cse1) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse2 (< |c_~#seed~0.offset| 0) (not .cse3) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) .cse0 .cse1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse2 .cse3 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:30:00,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse1 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse2 (not .cse4)) (.cse3 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) .cse1) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 .cse1 (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) .cse2)) (or .cse3 (< |c_~#seed~0.offset| 0) .cse2 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse3 .cse4 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) is different from false [2024-11-13 07:30:01,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse0 (< |c_~#seed~0.offset| 0) (not .cse1) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse1 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2024-11-13 07:30:01,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:30:03,432 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] [2024-11-13 07:30:03,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse26 (select .cse28 |c_~#seed~0.offset|))) (let ((.cse10 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse26))) (let ((.cse1 (not .cse10)) (.cse19 (store |c_#memory_int| |c_~#seed~0.base| (store .cse28 |c_~#seed~0.offset| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)))) (let ((.cse0 (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse27 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_50))) (or (= (select (select .cse27 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse27 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (.cse3 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse4 (= .cse26 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse2 (< |c_~#seed~0.offset| 0)) (.cse8 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))) (.cse9 (forall ((v_DerPreprocessor_45 (Array Int Int))) (let ((.cse25 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_45))) (or (not (= (select (select .cse25 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store .cse25 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) (.cse11 (forall ((v_DerPreprocessor_44 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_44))) (or (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store .cse24 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse24 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (.cse12 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_44))) (or (not (= (select (select (store (store .cse23 |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse23 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (.cse7 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse5 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (.cse14 (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_46) |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_46) |c_~#seed~0.base|) |c_~#seed~0.offset|))))) .cse1)) (.cse15 (or .cse10 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_47))) (or (not (= (select (select (store (store .cse22 |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select .cse22 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))))) (.cse6 (or .cse10 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_49))) (or (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse21 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse21 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) (.cse13 (or .cse1 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int))) (let ((.cse20 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_48))) (or (not (= (select (select (store .cse20 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select .cse20 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))))))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 .cse1 .cse2) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse3 .cse2 (not .cse4) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse5) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse5 (and (or .cse0 .cse1 .cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse2 (and .cse6 (or .cse7 (and (or (and .cse8 .cse9) .cse1) (or .cse10 (and .cse11 .cse12)))) .cse13 .cse14 .cse15)))) (or (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_51))) (or (= (select (select .cse16 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= 0 (select (select (store .cse16 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|)))))) .cse10) (or (and (or .cse10 (forall ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_53))) (or (not (= (select (select (store .cse17 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= (select (select .cse17 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))) (or .cse1 .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse18 (store .cse19 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_52))) (or (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse18 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse18 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) .cse7) (or .cse3 .cse4 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or .cse2 (and (or (and (or .cse1 (and (or .cse5 .cse8) .cse9)) (or .cse10 (and .cse11 (or .cse5 .cse12)))) .cse7) (or .cse5 (and .cse14 .cse15)) .cse6 .cse13)))))))) is different from false [2024-11-13 07:30:05,450 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] [2024-11-13 07:30:10,016 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] [2024-11-13 07:30:12,185 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] [2024-11-13 07:30:13,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (let ((.cse1 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse6)) (.cse2 (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse3 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse4 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse5 (= .cse6 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (or (and .cse1 .cse2 (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|))) .cse3) (not (= .cse0 0)) (or .cse4 (< |c_~#seed~0.offset| 0) (not .cse5) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or (and .cse1 (not (= .cse6 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) .cse2) .cse3) (or .cse4 .cse5 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) is different from false [2024-11-13 07:30:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-11-13 07:30:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-13 07:30:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2024-11-13 07:30:13,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 07:30:13,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:30:13,726 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:30:13,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:30:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash -64232771, now seen corresponding path program 2 times [2024-11-13 07:30:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:30:13,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496224251] [2024-11-13 07:30:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:30:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:30:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:30:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 151 proven. 44 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-13 07:30:14,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:30:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496224251] [2024-11-13 07:30:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496224251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:30:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563242018] [2024-11-13 07:30:14,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 07:30:14,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:30:14,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:30:14,184 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:30:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 07:30:14,335 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 07:30:14,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:30:14,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 07:30:14,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:30:14,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:30:14,442 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 [2024-11-13 07:30:14,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 07:30:14,502 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 [2024-11-13 07:30:15,029 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 07:30:15,032 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 25 treesize of output 18 [2024-11-13 07:30:15,086 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 17 treesize of output 12 [2024-11-13 07:30:15,090 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:30:15,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2024-11-13 07:30:15,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:30:15,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-13 07:30:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 68 proven. 73 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-13 07:30:15,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:30:15,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:30:15,291 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 191 treesize of output 203 [2024-11-13 07:30:15,310 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-13 07:30:15,310 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 179 treesize of output 183 [2024-11-13 07:30:17,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:30:17,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:30:17,328 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2024-11-13 07:30:17,330 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 25 treesize of output 17 [2024-11-13 07:30:17,334 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 6 treesize of output 4 [2024-11-13 07:30:17,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:30:17,339 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 37 [2024-11-13 07:30:17,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:30:17,343 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 31 treesize of output 23 [2024-11-13 07:30:17,345 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 6 treesize of output 4 [2024-11-13 07:30:17,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:30:17,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:30:17,351 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:30:17,351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 07:30:17,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:30:17,355 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 36 [2024-11-13 07:30:17,357 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:30:17,358 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 32 treesize of output 24 [2024-11-13 07:30:17,361 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 6 treesize of output 4 [2024-11-13 07:30:17,987 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 07:30:17,987 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 13 treesize of output 12 [2024-11-13 07:30:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 81 refuted. 58 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-13 07:30:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563242018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:30:18,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:30:18,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 43 [2024-11-13 07:30:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24699728] [2024-11-13 07:30:18,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:30:18,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 07:30:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:30:18,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 07:30:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1579, Unknown=22, NotChecked=0, Total=1806 [2024-11-13 07:30:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:30:18,158 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:30:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.976744186046512) internal successors, (257), 43 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 176 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 148 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 97 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 223 states. [2024-11-13 07:30:18,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:30:22,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse30 (select .cse10 |c_~#seed~0.offset|)) (.cse5 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))) (let ((.cse23 (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |c_thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|))) (.cse1 (not .cse5)) (.cse14 (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse29 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_59))) (or (not (= (select (select (store (store .cse31 |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse31 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (.cse16 (= .cse30 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse3 (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)))) (let ((.cse8 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_thr1Thread2of3ForFork0_calculateNext_~s2#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)))) (.cse4 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store .cse3 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (.cse15 (= (select |c_#valid| |c_~#seed~0.base|) 1)) (.cse12 (or .cse29 .cse16)) (.cse19 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse30)) (.cse18 (not (= .cse14 1))) (.cse20 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse13 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (.cse0 (< |c_~#seed~0.offset| 0)) (.cse7 (or (and (or (forall ((v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_59))) (or (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse28 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse28 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) .cse1) (or .cse29 .cse5)) .cse16)) (.cse6 (not .cse16)) (.cse21 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select (store .cse23 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))))) (and (or .cse0 (and (or (and (or .cse1 (forall ((v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse2 (store .cse3 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse2 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse2 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse4 .cse5)) .cse6) .cse7)) (<= 0 |c_~#seed~0.offset|) (or (and .cse7 (or .cse6 (and (or .cse5 .cse8) (or .cse1 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse9 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse9 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_thr1Thread2of3ForFork0_calculateNext_~s2#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)))))))) .cse0) (= (select |c_#valid| 3) 1) (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse11 (store .cse3 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (not (= (select (select (store .cse11 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= (select (select .cse11 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) .cse0 .cse6) (or (and .cse12 (or .cse6 .cse13)) .cse0 .cse5) (not (= .cse14 0)) (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|) (= c_~state~0 1) .cse1 (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) .cse15 (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse16 (forall ((v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_61))) (or (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse17 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse17 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse0 (and (or .cse6 .cse8) .cse12) .cse5) (or .cse0 (and (or .cse4 .cse6) .cse12) .cse5) (or (and (or (forall ((v_DerPreprocessor_56 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|)))) .cse1) (or (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse5)) .cse18 (not .cse19) .cse0 (not .cse15) .cse20 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse5 (and (or .cse6 .cse21) .cse12)) (or (forall ((v_DerPreprocessor_57 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse19 .cse18 .cse20) (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse22 (store .cse23 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= (select (select .cse22 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse22 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) .cse0 .cse6) (or .cse0 .cse6 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse24 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store .cse24 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse0 (and .cse7 (or .cse6 (and (or .cse5 .cse13) (or .cse1 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse25 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store .cse25 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))))))) (or (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse26 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse26 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_thr1Thread2of3ForFork0_calculateNext_~s2#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)))) .cse0 .cse6) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 (and .cse7 (or .cse6 (and (or .cse5 .cse21) (or .cse1 (forall ((v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse27 (store .cse23 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (not (= (select (select (store .cse27 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select .cse27 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))))))))))))) is different from false [2024-11-13 07:30:28,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse30 (select .cse10 |c_~#seed~0.offset|)) (.cse5 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))) (let ((.cse23 (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |c_thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|))) (.cse1 (not .cse5)) (.cse14 (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (.cse29 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_59))) (or (not (= (select (select (store (store .cse31 |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse31 |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (.cse16 (= .cse30 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse3 (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)))) (let ((.cse8 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_thr1Thread2of3ForFork0_calculateNext_~s2#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)))) (.cse4 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store .cse3 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (.cse15 (= (select |c_#valid| |c_~#seed~0.base|) 1)) (.cse12 (or .cse29 .cse16)) (.cse19 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| .cse30)) (.cse18 (not (= .cse14 1))) (.cse20 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse13 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (.cse0 (< |c_~#seed~0.offset| 0)) (.cse7 (or (and (or (forall ((v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_59))) (or (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse28 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse28 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) .cse1) (or .cse29 .cse5)) .cse16)) (.cse6 (not .cse16)) (.cse21 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select (store .cse23 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))))) (and (or .cse0 (and (or (and (or .cse1 (forall ((v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse2 (store .cse3 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse2 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse2 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse4 .cse5)) .cse6) .cse7)) (<= 0 |c_~#seed~0.offset|) (or (and .cse7 (or .cse6 (and (or .cse5 .cse8) (or .cse1 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse9 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (not (= (select (select (store .cse9 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_thr1Thread2of3ForFork0_calculateNext_~s2#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)))))))) .cse0) (= (select |c_#valid| 3) 1) (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse11 (store .cse3 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (not (= (select (select (store .cse11 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= (select (select .cse11 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))) .cse0 .cse6) (or (and .cse12 (or .cse6 .cse13)) .cse0 .cse5) (not (= .cse14 0)) (= c_~state~0 1) .cse1 (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) .cse15 (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or .cse16 (forall ((v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_61))) (or (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse17 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse17 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse0 (and (or .cse6 .cse8) .cse12) .cse5) (or .cse0 (and (or .cse4 .cse6) .cse12) .cse5) (or (and (or (forall ((v_DerPreprocessor_56 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|)))) .cse1) (or (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse5)) .cse18 (not .cse19) .cse0 (not .cse15) .cse20 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse0 .cse5 (and (or .cse6 .cse21) .cse12)) (or (forall ((v_DerPreprocessor_57 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse19 .cse18 .cse20) (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse22 (store .cse23 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= (select (select .cse22 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= (select (select (store .cse22 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) .cse0 .cse6) (or .cse0 .cse6 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse24 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store .cse24 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (or .cse0 (and .cse7 (or .cse6 (and (or .cse5 .cse13) (or .cse1 (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse25 |c_~#seed~0.base|) |c_~#seed~0.offset|))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|) (not (= (select (select (store .cse25 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))))))) (or (forall ((|thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| Int) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#seed~0.base| (store .cse10 |c_~#seed~0.offset| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1| 0) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select .cse26 |c_~#seed~0.base|) |c_~#seed~0.offset|)) (not (= (select (select (store .cse26 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |c_thr1Thread2of3ForFork0_calculateNext_~s2#1| |thr1Thread2of3ForFork0_calculateNext_~calculateNext_return~0#1|)))) .cse0 .cse6) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (or .cse0 (and .cse7 (or .cse6 (and (or .cse5 .cse21) (or .cse1 (forall ((v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse27 (store .cse23 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_58))) (or (not (= (select (select (store .cse27 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (not (= (select (select .cse27 |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))))))))))))))) is different from false [2024-11-13 07:30:29,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= .cse0 |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:30:29,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (<= 0 |c_~#seed~0.offset|) (not (= (select (select |c_#memory_int| 3) |c_~#seed~0.offset|) 0)) (or (let ((.cse0 (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_56 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_56) |c_~#seed~0.base|) |c_~#seed~0.offset|)))) (not .cse0)) (or (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_54) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0))) .cse1 (not .cse2) (< |c_~#seed~0.offset| 0) (not (= (select |c_#valid| |c_~#seed~0.base|) 1)) .cse3 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4))) (= |c_~#seed~0.base| 3) (or (forall ((v_DerPreprocessor_57 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_57) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse2 .cse1 .cse3))) is different from false [2024-11-13 07:30:29,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (not (= |c_thr1Thread1of3ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:30:30,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< (select |c_#length| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (.cse0 (select (select |c_#memory_int| 3) |c_~#seed~0.offset|))) (and (<= 0 |c_~#seed~0.offset|) (= (select |c_#valid| 3) 1) (= c_~state~0 1) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |c_thr1Thread1of3ForFork0_calculateNext_~s2#1|) (not (= 3 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (not (= .cse0 0)) (or .cse1 (< |c_~#seed~0.offset| 0) (not .cse2) (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_42) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (forall ((v_DerPreprocessor_40 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_40) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= |c_~#seed~0.base| 3) (or .cse1 .cse2 (forall ((v_DerPreprocessor_43 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (= .cse0 |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) is different from false [2024-11-13 07:30:53,963 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (and (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 0)) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse3))) is different from true [2024-11-13 07:30:57,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse1 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse0 (select |c_#valid| |c_~#seed~0.base|)) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (not (= .cse0 0)) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse1 .cse2 .cse3) (or .cse2 (not .cse1) (< |c_~#seed~0.offset| 0) (not (= .cse0 1)) .cse3 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse4 |c_~#seed~0.offset|) 0)) (not (= .cse4 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))))) is different from false [2024-11-13 07:30:57,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 1))) (.cse1 (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (.cse0 (select |c_#valid| |c_~#seed~0.base|)) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 4))) (and (not (= .cse0 0)) (or (forall ((v_DerPreprocessor_28 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse1 .cse2 .cse3) (or .cse2 (not .cse1) (< |c_~#seed~0.offset| 0) (not (= .cse0 1)) .cse3 (< (select |c_#length| |c_~#seed~0.base|) (+ |c_~#seed~0.offset| 4)) (and (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#seed~0.base|))) (or (not (= (select .cse4 |c_~#seed~0.offset|) 0)) (not (= .cse4 v_DerPreprocessor_29))))) (or (forall ((v_DerPreprocessor_31 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|))))) (not (= 0 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|)))) is different from false [2024-11-13 07:30:58,619 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse3 (not (= (select .cse1 |c_~#seed~0.offset|) 0)))) (and (= c_~state~0 1) (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse0 (select .cse2 |c_~#seed~0.offset|))) (and (not (= .cse0 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse1 |c_~#seed~0.offset| .cse0) .cse2))))) .cse3) (and (<= 0 |c_~#seed~0.offset|) .cse3)) (not |c_thr1Thread1of3ForFork0_#t~switch10#1|) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse3))) is different from true [2024-11-13 07:31:00,599 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse2 (= (select .cse4 |c_~#seed~0.offset|) 0))) (let ((.cse0 (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|)) (.cse1 (not .cse2))) (and (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset|) 1) (or (and .cse0 .cse1) (and .cse2 (= 0 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|))) (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|) 0)) .cse0 (= c_~state~0 1) (not (= |c_~#seed~0.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse3 (select .cse5 |c_~#seed~0.offset|))) (and (not (= .cse3 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse4 |c_~#seed~0.offset| .cse3) .cse5))))) .cse1) (and (<= 0 |c_~#seed~0.offset|) .cse1)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (= |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| 1) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) .cse1)))) is different from true [2024-11-13 07:31:02,267 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#seed~0.base|))) (let ((.cse2 (= (select .cse4 |c_~#seed~0.offset|) 0))) (let ((.cse0 (= 1 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|)) (.cse1 (not .cse2))) (and (or (and .cse0 .cse1) (and .cse2 (= 0 |c_thr1Thread3of3ForFork0_PseudoRandomUsingAtomic_monitor_~cond~0#1|))) .cse0 (= (select |c_#valid| |c_~#seed~0.base|) 1) (or (and (exists ((|thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#seed~0.base| v_DerPreprocessor_19) |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#seed~0.base|))) (let ((.cse3 (select .cse5 |c_~#seed~0.offset|))) (and (not (= .cse3 0)) (not (= |c_~#seed~0.base| |thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base|)) (= (store .cse4 |c_~#seed~0.offset| .cse3) .cse5))))) .cse1) (and (<= 0 |c_~#seed~0.offset|) .cse1)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| |c_~#seed~0.base|)) (not (= |c_thr1Thread2of3ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0)) .cse1)))) is different from true [2024-11-13 07:31:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-11-13 07:31:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2024-11-13 07:31:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2024-11-13 07:31:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-13 07:31:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2024-11-13 07:31:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-11-13 07:31:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-13 07:31:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-13 07:31:16,429 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err4ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:31:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:31:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -450297932, now seen corresponding path program 1 times [2024-11-13 07:31:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:31:16,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026388851] [2024-11-13 07:31:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:31:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:31:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:31:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 07:31:16,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:31:16,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026388851] [2024-11-13 07:31:16,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026388851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:31:16,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:31:16,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:31:16,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618576769] [2024-11-13 07:31:16,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:31:16,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:31:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:31:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:31:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:31:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:16,448 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:31:16,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:31:16,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 203 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 194 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 253 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2024-11-13 07:31:16,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2024-11-13 07:31:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-13 07:31:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2024-11-13 07:31:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-11-13 07:31:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 07:31:24,614 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:31:24,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:31:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1826332986, now seen corresponding path program 1 times [2024-11-13 07:31:24,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:31:24,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582865727] [2024-11-13 07:31:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:31:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:31:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:31:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 07:31:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:31:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582865727] [2024-11-13 07:31:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582865727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:31:24,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:31:24,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:31:24,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594277142] [2024-11-13 07:31:24,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:31:24,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 07:31:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:31:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 07:31:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 07:31:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:24,638 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:31:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:31:24,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:24,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:24,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 203 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 195 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 150 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 253 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 07:31:34,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:31:34,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:31:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1339543651, now seen corresponding path program 1 times [2024-11-13 07:31:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:31:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694860190] [2024-11-13 07:31:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:31:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:31:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:31:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 07:31:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:31:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694860190] [2024-11-13 07:31:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694860190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:31:34,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:31:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:31:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077470033] [2024-11-13 07:31:34,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:31:34,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:31:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:31:34,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:31:34,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:31:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:34,910 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:31:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 204 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 255 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:34,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 07:31:41,458 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:31:41,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:31:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1339543650, now seen corresponding path program 1 times [2024-11-13 07:31:41,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:31:41,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926694808] [2024-11-13 07:31:41,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:31:41,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:31:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:31:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 07:31:41,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:31:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926694808] [2024-11-13 07:31:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926694808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:31:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:31:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:31:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021497096] [2024-11-13 07:31:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:31:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:31:41,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:31:41,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:31:41,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:31:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:41,620 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:31:41,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 204 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2024-11-13 07:31:41,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 255 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-13 07:31:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 07:31:47,792 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-13 07:31:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:31:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1339543646, now seen corresponding path program 1 times [2024-11-13 07:31:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:31:47,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724199767] [2024-11-13 07:31:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:31:47,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:31:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:31:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 07:31:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:31:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724199767] [2024-11-13 07:31:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724199767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:31:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:31:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:31:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126182353] [2024-11-13 07:31:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:31:47,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:31:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:31:47,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:31:47,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:31:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:31:47,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:31:47,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 07:31:47,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 204 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 255 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:31:47,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.