./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-18 00:14:16,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 00:14:16,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 00:14:16,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 00:14:16,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 00:14:16,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 00:14:16,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 00:14:16,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 00:14:16,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 00:14:16,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 00:14:16,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 00:14:16,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 00:14:16,859 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 00:14:16,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 00:14:16,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 00:14:16,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 00:14:16,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 00:14:16,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 00:14:16,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 00:14:16,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 00:14:16,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 00:14:16,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 00:14:16,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 00:14:16,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 00:14:16,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 00:14:16,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 00:14:16,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 00:14:16,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 00:14:16,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 00:14:16,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 00:14:16,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 00:14:16,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 00:14:16,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 00:14:16,866 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 00:14:16,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 00:14:16,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 00:14:16,866 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 00:14:16,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 00:14:16,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 00:14:16,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 00:14:16,867 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 00:14:16,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 546 [2024-10-18 00:14:17,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 00:14:17,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 00:14:17,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 00:14:17,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 00:14:17,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 00:14:17,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-10-18 00:14:18,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 00:14:18,910 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 00:14:18,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2024-10-18 00:14:18,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/36a2b8f41/22a9a11e5dc3411cb892e0c0c91be56f/FLAG6443bbbe2 [2024-10-18 00:14:19,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/36a2b8f41/22a9a11e5dc3411cb892e0c0c91be56f [2024-10-18 00:14:19,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 00:14:19,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 00:14:19,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 00:14:19,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 00:14:19,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 00:14:19,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c7e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19, skipping insertion in model container [2024-10-18 00:14:19,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 00:14:19,666 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2024-10-18 00:14:19,679 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2024-10-18 00:14:19,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 00:14:19,699 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 00:14:19,750 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2024-10-18 00:14:19,757 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2024-10-18 00:14:19,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 00:14:19,807 INFO L204 MainTranslator]: Completed translation [2024-10-18 00:14:19,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19 WrapperNode [2024-10-18 00:14:19,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 00:14:19,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 00:14:19,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 00:14:19,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 00:14:19,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,863 INFO L138 Inliner]: procedures = 174, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-10-18 00:14:19,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 00:14:19,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 00:14:19,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 00:14:19,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 00:14:19,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 00:14:19,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 00:14:19,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 00:14:19,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 00:14:19,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (1/1) ... [2024-10-18 00:14:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 00:14:19,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:19,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:19,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-18 00:14:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 00:14:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 00:14:19,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 00:14:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 00:14:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 00:14:19,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 00:14:19,997 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 00:14:20,156 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 00:14:20,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 00:14:20,474 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 00:14:20,475 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 00:14:20,669 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 00:14:20,673 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-18 00:14:20,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 12:14:20 BoogieIcfgContainer [2024-10-18 00:14:20,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 00:14:20,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 00:14:20,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 00:14:20,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 00:14:20,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 12:14:19" (1/3) ... [2024-10-18 00:14:20,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb4e61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 12:14:20, skipping insertion in model container [2024-10-18 00:14:20,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:19" (2/3) ... [2024-10-18 00:14:20,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb4e61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 12:14:20, skipping insertion in model container [2024-10-18 00:14:20,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 12:14:20" (3/3) ... [2024-10-18 00:14:20,685 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2024-10-18 00:14:20,703 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 00:14:20,704 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-18 00:14:20,704 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 00:14:20,777 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 00:14:20,825 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:20,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:20,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:20,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-18 00:14:20,921 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:20,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 00:14:20,945 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c8f2fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:20,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 00:14:21,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:21,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1577241718, now seen corresponding path program 1 times [2024-10-18 00:14:21,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:21,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176960449] [2024-10-18 00:14:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176960449] [2024-10-18 00:14:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176960449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:21,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957401828] [2024-10-18 00:14:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:21,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:21,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:21,585 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:21,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-10-18 00:14:21,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:21,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 00:14:21,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:21,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:21,831 INFO L85 PathProgramCache]: Analyzing trace with hash -791172917, now seen corresponding path program 1 times [2024-10-18 00:14:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:21,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721746845] [2024-10-18 00:14:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:21,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721746845] [2024-10-18 00:14:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721746845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:22,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463102059] [2024-10-18 00:14:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:22,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:22,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:22,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:22,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:22,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:22,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 00:14:22,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1012681165, now seen corresponding path program 1 times [2024-10-18 00:14:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811962232] [2024-10-18 00:14:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811962232] [2024-10-18 00:14:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811962232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-18 00:14:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743397483] [2024-10-18 00:14:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:23,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:14:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:14:23,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-18 00:14:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:23,099 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:23,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-18 00:14:23,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:23,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1091874855, now seen corresponding path program 1 times [2024-10-18 00:14:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135934904] [2024-10-18 00:14:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:24,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135934904] [2024-10-18 00:14:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135934904] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332231920] [2024-10-18 00:14:24,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:24,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:24,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:14:24,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-18 00:14:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:24,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-18 00:14:24,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:24,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:14:24,652 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-10-18 00:14:24,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2024-10-18 00:14:24,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2024-10-18 00:14:24,808 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 35 treesize of output 40 [2024-10-18 00:14:24,832 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-18 00:14:24,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2024-10-18 00:14:24,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2024-10-18 00:14:24,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2024-10-18 00:14:24,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-10-18 00:14:24,920 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-18 00:14:24,922 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 1 case distinctions, treesize of input 11 treesize of output 15 [2024-10-18 00:14:24,933 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-10-18 00:14:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:25,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 00:14:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332231920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:25,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 00:14:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2024-10-18 00:14:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710698733] [2024-10-18 00:14:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:25,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 00:14:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 00:14:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-18 00:14:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,238 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:25,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:25,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:25,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:25,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 00:14:25,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-18 00:14:25,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-18 00:14:25,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-18 00:14:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:25,789 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 00:14:25,791 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE (1/2) [2024-10-18 00:14:25,795 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:25,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:25,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:25,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:25,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-18 00:14:25,840 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:25,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:25,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 00:14:25,842 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c8f2fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:25,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 00:14:26,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:26,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash -394151212, now seen corresponding path program 1 times [2024-10-18 00:14:26,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:26,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055556853] [2024-10-18 00:14:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:26,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:26,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055556853] [2024-10-18 00:14:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055556853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:26,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655360049] [2024-10-18 00:14:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:26,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:26,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,025 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:26,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:26,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 00:14:26,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:26,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash -107948567, now seen corresponding path program 1 times [2024-10-18 00:14:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:26,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790692708] [2024-10-18 00:14:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:26,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790692708] [2024-10-18 00:14:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790692708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:26,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351403223] [2024-10-18 00:14:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:26,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:26,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,318 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:26,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:26,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 00:14:26,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash -790219429, now seen corresponding path program 1 times [2024-10-18 00:14:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771489266] [2024-10-18 00:14:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:26,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 00:14:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:26,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 00:14:26,431 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 00:14:26,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 00:14:26,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-18 00:14:26,433 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 00:14:26,434 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 00:14:26,434 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 00:14:26,434 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 00:14:26,476 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 00:14:26,478 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:26,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:26,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:26,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-18 00:14:26,531 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:26,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:26,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 00:14:26,532 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c8f2fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:26,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 00:14:27,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1774236791, now seen corresponding path program 1 times [2024-10-18 00:14:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:27,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930080582] [2024-10-18 00:14:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930080582] [2024-10-18 00:14:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930080582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:27,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214885172] [2024-10-18 00:14:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:27,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:27,355 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:27,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:27,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:27,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-18 00:14:27,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:27,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash 234589399, now seen corresponding path program 1 times [2024-10-18 00:14:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:27,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629990603] [2024-10-18 00:14:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:27,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:27,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629990603] [2024-10-18 00:14:27,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629990603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:27,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:27,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251750554] [2024-10-18 00:14:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:27,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:27,917 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:27,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:27,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:27,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:28,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-18 00:14:28,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:28,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2127660795, now seen corresponding path program 1 times [2024-10-18 00:14:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:28,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79598871] [2024-10-18 00:14:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79598871] [2024-10-18 00:14:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79598871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:28,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:28,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440044496] [2024-10-18 00:14:28,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:28,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:28,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:28,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:28,126 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:28,126 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-10-18 00:14:28,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:28,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:28,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:28,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-18 00:14:28,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:28,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 436727831, now seen corresponding path program 1 times [2024-10-18 00:14:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763148652] [2024-10-18 00:14:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:28,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 00:14:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:28,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 00:14:28,220 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 00:14:28,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 00:14:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-18 00:14:28,222 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 00:14:28,222 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 00:14:28,222 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 00:14:28,222 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 00:14:28,276 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 00:14:28,279 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:28,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:28,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:28,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-18 00:14:28,336 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:28,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 00:14:28,337 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c8f2fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:28,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-18 00:14:30,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash -478542851, now seen corresponding path program 1 times [2024-10-18 00:14:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:30,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283568790] [2024-10-18 00:14:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283568790] [2024-10-18 00:14:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283568790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:30,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:30,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070970038] [2024-10-18 00:14:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:30,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:30,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:30,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:30,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:30,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:30,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-18 00:14:30,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 112349234, now seen corresponding path program 1 times [2024-10-18 00:14:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:30,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095603318] [2024-10-18 00:14:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095603318] [2024-10-18 00:14:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095603318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:31,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:31,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051847501] [2024-10-18 00:14:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:31,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,097 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:31,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:31,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-18 00:14:31,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:31,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1144983996, now seen corresponding path program 1 times [2024-10-18 00:14:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087106404] [2024-10-18 00:14:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087106404] [2024-10-18 00:14:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087106404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962395814] [2024-10-18 00:14:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,321 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:31,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:31,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-18 00:14:31,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:31,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:31,429 INFO L85 PathProgramCache]: Analyzing trace with hash -427483150, now seen corresponding path program 1 times [2024-10-18 00:14:31,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:31,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352406499] [2024-10-18 00:14:31,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:31,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 00:14:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:31,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352406499] [2024-10-18 00:14:31,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352406499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:31,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:31,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-18 00:14:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370992496] [2024-10-18 00:14:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:31,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-18 00:14:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:31,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-18 00:14:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-18 00:14:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,510 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:31,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:31,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-18 00:14:31,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1376370932, now seen corresponding path program 1 times [2024-10-18 00:14:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212797060] [2024-10-18 00:14:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212797060] [2024-10-18 00:14:32,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212797060] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644656728] [2024-10-18 00:14:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:32,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:32,433 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-10-18 00:14:32,435 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-10-18 00:14:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:32,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-18 00:14:32,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:32,902 INFO L349 Elim1Store]: treesize reduction 104, result has 21.8 percent of original size [2024-10-18 00:14:32,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 42 [2024-10-18 00:14:32,958 INFO L349 Elim1Store]: treesize reduction 122, result has 18.7 percent of original size [2024-10-18 00:14:32,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 87 [2024-10-18 00:14:33,001 INFO L349 Elim1Store]: treesize reduction 93, result has 16.2 percent of original size [2024-10-18 00:14:33,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 85 [2024-10-18 00:14:33,096 INFO L349 Elim1Store]: treesize reduction 68, result has 35.2 percent of original size [2024-10-18 00:14:33,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 64 [2024-10-18 00:14:33,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-18 00:14:33,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2024-10-18 00:14:33,253 INFO L349 Elim1Store]: treesize reduction 158, result has 0.6 percent of original size [2024-10-18 00:14:33,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 66 treesize of output 1 [2024-10-18 00:14:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 00:14:33,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 00:14:33,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644656728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:33,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 00:14:33,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2024-10-18 00:14:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53382505] [2024-10-18 00:14:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:14:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:33,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:14:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-18 00:14:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:33,374 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:33,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:33,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:33,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:33,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:33,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:33,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:35,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 00:14:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:14:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 00:14:35,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-18 00:14:35,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-18 00:14:35,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 215833030, now seen corresponding path program 1 times [2024-10-18 00:14:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428037637] [2024-10-18 00:14:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-18 00:14:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428037637] [2024-10-18 00:14:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428037637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848271996] [2024-10-18 00:14:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:36,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:36,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:36,081 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-10-18 00:14:36,083 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-10-18 00:14:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:36,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-18 00:14:36,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:36,432 INFO L349 Elim1Store]: treesize reduction 30, result has 23.1 percent of original size [2024-10-18 00:14:36,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 93 [2024-10-18 00:14:36,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:36,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:37,356 INFO L349 Elim1Store]: treesize reduction 271, result has 33.7 percent of original size [2024-10-18 00:14:37,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 873 treesize of output 1104 [2024-10-18 00:14:37,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2024-10-18 00:14:37,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:37,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:37,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,683 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:37,782 INFO L349 Elim1Store]: treesize reduction 274, result has 5.8 percent of original size [2024-10-18 00:14:37,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 939 treesize of output 1300 [2024-10-18 00:14:37,977 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 2568 treesize of output 2423 [2024-10-18 00:14:38,271 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 1987 treesize of output 1925 [2024-10-18 00:14:38,404 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 136 treesize of output 127 [2024-10-18 00:14:38,543 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 287 treesize of output 267 [2024-10-18 00:14:38,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 133 [2024-10-18 00:14:38,664 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 317 treesize of output 476 [2024-10-18 00:14:39,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 87 treesize of output 115 [2024-10-18 00:14:39,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:39,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:39,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:39,491 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:39,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:39,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:39,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:39,652 INFO L349 Elim1Store]: treesize reduction 116, result has 12.8 percent of original size [2024-10-18 00:14:39,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 734 treesize of output 1187 [2024-10-18 00:14:40,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2024-10-18 00:14:41,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 507 [2024-10-18 00:14:41,538 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 7 treesize of output 5 [2024-10-18 00:14:41,778 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 7 treesize of output 5 [2024-10-18 00:14:41,859 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 7 treesize of output 5 [2024-10-18 00:14:41,920 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 7 treesize of output 5 [2024-10-18 00:14:41,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:41,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:41,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 28 treesize of output 17 [2024-10-18 00:14:42,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:42,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:42,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 28 treesize of output 17 [2024-10-18 00:14:42,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:42,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:42,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 28 treesize of output 17 [2024-10-18 00:14:42,235 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 7 treesize of output 5 [2024-10-18 00:14:42,297 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 7 treesize of output 5 [2024-10-18 00:14:42,354 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 7 treesize of output 5 [2024-10-18 00:14:42,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:42,612 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 17 treesize of output 3 [2024-10-18 00:14:42,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:42,648 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 17 treesize of output 3 [2024-10-18 00:14:43,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 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 1121 treesize of output 1189 [2024-10-18 00:14:44,109 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 7 treesize of output 5 [2024-10-18 00:14:44,275 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 7 treesize of output 5 [2024-10-18 00:14:44,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:44,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:44,477 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:44,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 43 treesize of output 47 [2024-10-18 00:14:44,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:44,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:44,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:44,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 43 treesize of output 47 [2024-10-18 00:14:44,845 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 7 treesize of output 5 [2024-10-18 00:14:44,968 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 7 treesize of output 5 [2024-10-18 00:14:45,377 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 7 treesize of output 5 [2024-10-18 00:14:45,440 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 7 treesize of output 5 [2024-10-18 00:14:45,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:45,565 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 21 treesize of output 3 [2024-10-18 00:14:45,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:45,666 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 21 treesize of output 3 [2024-10-18 00:14:46,987 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-18 00:14:47,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2024-10-18 00:14:47,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2024-10-18 00:14:47,289 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 315 treesize of output 474 [2024-10-18 00:14:47,927 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-18 00:15:04,395 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 445 DAG size of output: 439 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 00:15:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:15:18,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 00:15:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848271996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:15:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 00:15:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2024-10-18 00:15:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242508698] [2024-10-18 00:15:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:15:18,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:15:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:15:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:15:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=168, Unknown=19, NotChecked=0, Total=240 [2024-10-18 00:15:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:18,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:15:18,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:15:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:15:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 00:15:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:15:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-18 00:15:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:24,908 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-10-18 00:15:29,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:15:37,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:15:41,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:15:45,261 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-10-18 00:17:39,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85m for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:17:42,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:17:46,158 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-10-18 00:17:47,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:17:47,878 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#dec_flag~0.base|))) (let ((.cse45 (= 0 |c_~#value~0.offset|)) (.cse17 (select .cse7 0))) (let ((.cse22 (= .cse17 1)) (.cse34 (not .cse45)) (.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| 0) (let ((.cse33 (= (select .cse4 0) 1)) (.cse32 (= 1 |c_thr1Thread2of3ForFork0_dec_#t~mem13#1|))) (or (and (or (exists ((|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (and (exists ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_273 (Array Int Int)) (v_arrayElimArr_38 (Array Int Int)) (v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_93) |c_~#dec_flag~0.base| v_DerPreprocessor_94) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_95))) (let ((.cse1 (select .cse8 |c_~#dec_flag~0.base|))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse8 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse1) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1) |c_~#value~0.base|)))) (let ((.cse6 (store (store .cse5 |c_~#dec_flag~0.base| v_DerPreprocessor_61) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_33))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_69) |c_~#value~0.base| v_DerPreprocessor_70) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_38)) (.cse3 (select .cse6 |c_~#value~0.base|))) (and (= (select .cse0 |c_~#dec_flag~0.base|) .cse1) (= (store (store v_arrayElimArr_38 |c_~#value~0.offset| (select .cse1 |c_~#value~0.offset|)) 0 1) .cse1) (= .cse2 .cse1) (= v_DerPreprocessor_95 .cse1) (= (store (store .cse3 |c_~#value~0.offset| (select v_prenex_271 |c_~#value~0.offset|)) 0 1) v_prenex_271) (= .cse4 (select .cse0 |c_~#value~0.base|)) (= .cse4 (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_272) |c_~#value~0.base| v_prenex_273) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse1) |c_~#value~0.base|)) (= (select v_arrayElimArr_33 0) 1) (= (select (store (store .cse5 |c_~#dec_flag~0.base| v_DerPreprocessor_73) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_271) |c_~#dec_flag~0.base|) .cse1) (= (select v_arrayElimArr_38 0) 1) (= (select .cse3 |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= (select .cse6 |c_~#dec_flag~0.base|) .cse1) (= .cse7 .cse1)))))))) (not (= |c_~#value~0.base| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (not (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (= (select .cse2 0) |c_thr1Thread2of3ForFork0_dec_#t~mem13#1|)))) (exists ((|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (and (exists ((v_prenex_270 (Array Int Int)) (v_prenex_220 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_267 (Array Int Int)) (v_prenex_268 (Array Int Int)) (v_prenex_269 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_219 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_96) |c_~#dec_flag~0.base| v_DerPreprocessor_97) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_98))) (let ((.cse11 (select .cse16 |c_~#dec_flag~0.base|))) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse16 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse11) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse11) |c_~#value~0.base|)))) (let ((.cse15 (store (store .cse10 |c_~#dec_flag~0.base| v_prenex_270) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_267))) (let ((.cse12 (select .cse15 |c_~#value~0.base|)) (.cse14 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_221) |c_~#value~0.base| v_prenex_219) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_220)) (.cse13 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_87) |c_~#value~0.base| v_DerPreprocessor_88) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse11))) (and (= .cse9 (store (store v_prenex_220 |c_~#value~0.offset| (select .cse9 |c_~#value~0.offset|)) 0 1)) (= (select (store (store .cse10 |c_~#dec_flag~0.base| v_prenex_268) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_269) |c_~#dec_flag~0.base|) .cse11) (= (select .cse12 |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= .cse4 (select .cse13 |c_~#value~0.base|)) (= (select v_prenex_220 0) 1) (= .cse4 (select .cse14 |c_~#value~0.base|)) (= .cse11 (select .cse15 |c_~#dec_flag~0.base|)) (= (store (store .cse12 |c_~#value~0.offset| (select v_prenex_269 |c_~#value~0.offset|)) 0 1) v_prenex_269) (= (select .cse11 0) 1) (= (select .cse14 |c_~#dec_flag~0.base|) .cse11) (= .cse11 v_DerPreprocessor_98) (= (select v_prenex_267 0) 1) (= .cse11 .cse7) (= .cse11 (select .cse13 |c_~#dec_flag~0.base|))))))))) (not (= |c_~#value~0.base| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (not (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (= (select .cse9 0) |c_thr1Thread2of3ForFork0_dec_#t~mem13#1|)))) (and (= .cse17 |c_thr1Thread2of3ForFork0_dec_#t~mem13#1|) (let ((.cse26 (select .cse7 |c_~#value~0.offset|))) (let ((.cse21 (exists ((v_DerPreprocessor_99 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (.cse20 (exists ((v_DerPreprocessor_99 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|))) (and (= (select .cse28 |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= (store (store .cse28 |c_~#value~0.offset| .cse26) 0 1) .cse7))))) (.cse24 (exists ((v_DerPreprocessor_99 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_prenex_38) |c_~#value~0.base|))) (and (= (select v_prenex_38 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse27 |c_~#value~0.offset|)) (= (store (store .cse27 |c_~#value~0.offset| .cse26) 0 1) .cse7))))) (.cse19 (exists ((v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (and (= (select v_prenex_46 0) 1) (= (store (store v_prenex_46 |c_~#value~0.offset| .cse26) 0 1) .cse7) (= .cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| v_prenex_44) |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base|))))) (.cse25 (exists ((v_prenex_265 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_prenex_265) |c_~#value~0.base|) |c_~#value~0.offset|)) (= (select v_prenex_265 0) 1)))) (.cse23 (exists ((v_prenex_40 (Array Int Int))) (= (select (store (store |c_#memory_int| |c_~#value~0.base| v_prenex_40) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|) .cse4))) (.cse18 (exists ((v_DerPreprocessor_76 (Array Int Int))) (= .cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_76) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|))))) (or (and .cse18 .cse19 .cse20) (and .cse21 .cse18 .cse19) (and .cse22 .cse21 .cse23 .cse18) (and .cse23 .cse18 .cse20) (and .cse24 .cse23 .cse18) (and .cse24 .cse18 .cse19) (and .cse25 .cse18 .cse19) (and .cse22 .cse25 .cse23 .cse18))))) (and (exists ((v_DerPreprocessor_127 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (v_DerPreprocessor_123 (Array Int Int)) (v_DerPreprocessor_124 (Array Int Int)) (v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_130 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_118 (Array Int Int))) (let ((.cse30 (select v_DerPreprocessor_123 |c_~#value~0.offset|)) (.cse31 (select v_DerPreprocessor_60 |c_~#value~0.offset|)) (.cse29 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_126) |c_~#value~0.base| v_DerPreprocessor_127) |c_~#dec_flag~0.base|))) (and (= .cse29 .cse7) (= (select v_DerPreprocessor_121 0) 1) (= (select v_DerPreprocessor_118 |c_~#value~0.offset|) (select v_DerPreprocessor_121 |c_~#value~0.offset|)) (= (store (store v_DerPreprocessor_118 |c_~#value~0.offset| .cse30) 0 1) v_DerPreprocessor_123) (= .cse29 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_117) |c_~#value~0.base| v_DerPreprocessor_118) |c_~#dec_flag~0.base|)) (= v_DerPreprocessor_60 (store (store .cse4 |c_~#value~0.offset| .cse31) 0 1)) (= (store (store v_DerPreprocessor_121 |c_~#value~0.offset| (select v_DerPreprocessor_127 |c_~#value~0.offset|)) 0 1) v_DerPreprocessor_127) (= .cse30 (select .cse4 |c_~#value~0.offset|)) (= .cse29 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_114) |c_~#value~0.base| .cse29) |c_~#dec_flag~0.base|)) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| .cse31) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_61) |c_~#value~0.base| v_DerPreprocessor_60) |c_~#dec_flag~0.base|) .cse29) (= .cse29 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_124) |c_~#value~0.base| v_DerPreprocessor_123) |c_~#dec_flag~0.base|)) (= .cse29 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_120) |c_~#value~0.base| v_DerPreprocessor_121) |c_~#dec_flag~0.base|)) (= (select v_DerPreprocessor_118 0) 1) (= .cse29 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_130) |c_~#value~0.base| .cse29) |c_~#dec_flag~0.base|)) (= (select .cse29 0) 1)))) .cse32 .cse33)) .cse34) (and (or (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| v_DerPreprocessor_52) |c_~#dec_flag~0.base|))) (and (= .cse35 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_52) |c_~#dec_flag~0.base|)) (= .cse35 .cse7) (= (select v_DerPreprocessor_54 0) 1) (= (select v_DerPreprocessor_52 0) 1) (= (select .cse35 0) 1) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_55) |c_~#value~0.base| v_DerPreprocessor_54) |c_~#dec_flag~0.base|) .cse35) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_45) |c_~#value~0.base| .cse35) |c_~#dec_flag~0.base|) .cse35) (= .cse35 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_58) |c_~#value~0.base| .cse35) |c_~#dec_flag~0.base|)) (= .cse35 (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_48) |c_~#value~0.base| v_DerPreprocessor_54) |c_~#dec_flag~0.base|)) (= (select (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_13) |c_~#value~0.base| .cse4) |c_~#dec_flag~0.base|) .cse35)))) .cse32 .cse33) (and .cse22 .cse32 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_39) |c_~#dec_flag~0.base| v_DerPreprocessor_40) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse41 (store |c_#memory_int| |c_~#value~0.base| (select .cse44 |c_~#value~0.base|)))) (let ((.cse39 (store (store .cse41 |c_~#dec_flag~0.base| v_DerPreprocessor_34) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7))) (let ((.cse38 (store |c_#memory_int| |c_~#value~0.base| (select .cse39 |c_~#value~0.base|)))) (let ((.cse40 (select |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (.cse42 (store (store .cse38 |c_~#dec_flag~0.base| (select .cse44 |c_~#dec_flag~0.base|)) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse37 (select .cse42 |c_~#value~0.base|)) (.cse36 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse40)) (.cse43 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_42) |c_~#value~0.base| v_DerPreprocessor_43) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7))) (and (= (select .cse36 |c_~#value~0.base|) .cse4) (= (select .cse37 0) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|) (= (select v_DerPreprocessor_41 0) 1) (= (store (store .cse38 |c_~#dec_flag~0.base| .cse7) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7) .cse39) (= (select .cse40 0) 1) (= (select (store (store .cse41 |c_~#dec_flag~0.base| v_DerPreprocessor_37) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7) |c_~#dec_flag~0.base|) .cse7) (= (select (store (store .cse38 |c_~#dec_flag~0.base| v_DerPreprocessor_16) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (store .cse37 0 1)) |c_~#dec_flag~0.base|) .cse7) (= (select .cse42 |c_~#dec_flag~0.base|) .cse7) (not (= |c_~#value~0.base| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (= (select .cse43 |c_~#dec_flag~0.base|) .cse7) (= (select .cse36 |c_~#dec_flag~0.base|) .cse7) (not (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (= .cse4 (select .cse43 |c_~#value~0.base|))))))))))) (and .cse22 .cse32 (exists ((v_DerPreprocessor_32 (Array Int Int))) (= .cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_32) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|))) (exists ((v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select v_DerPreprocessor_29 0) 1) (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_28) |c_~#dec_flag~0.base| v_DerPreprocessor_29) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_DerPreprocessor_29) |c_~#value~0.base|) 0) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (exists ((v_DerPreprocessor_10 (Array Int Int))) (= .cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_10) |c_~#dec_flag~0.base| .cse7) |c_~#value~0.base|))))) .cse45))) (<= 5 |c_~#dec_flag~0.base|) (let ((.cse56 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (.cse65 (= |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#dec_flag~0.base|)) (.cse55 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (let ((.cse46 (= (select .cse55 0) 1)) (.cse73 (not .cse65)) (.cse57 (not .cse56))) (or (and .cse45 (or (and .cse46 (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| v_DerPreprocessor_52) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_53))) (let ((.cse49 (select .cse51 |c_~#dec_flag~0.base|))) (let ((.cse47 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_57) |c_~#dec_flag~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse49)) (.cse50 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_12) |c_~#dec_flag~0.base| v_DerPreprocessor_13) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse55)) (.cse54 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_53)) (.cse52 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_48) |c_~#value~0.base| v_DerPreprocessor_49) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_29)) (.cse53 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_45) |c_~#value~0.base| v_DerPreprocessor_46) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse49)) (.cse48 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_54) |c_~#dec_flag~0.base| v_DerPreprocessor_55) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_29))) (and (= v_DerPreprocessor_57 (select .cse47 |c_~#value~0.base|)) (= v_DerPreprocessor_54 (select .cse48 |c_~#value~0.base|)) (= (select .cse47 |c_~#dec_flag~0.base|) .cse49) (= v_DerPreprocessor_12 (select .cse50 |c_~#value~0.base|)) (= v_DerPreprocessor_52 (select .cse51 |c_~#value~0.base|)) (= (select v_DerPreprocessor_53 0) 1) (= (select .cse50 |c_~#dec_flag~0.base|) .cse49) (= (select .cse49 0) 1) (= (select .cse52 |c_~#value~0.base|) v_DerPreprocessor_49) (= .cse7 .cse49) (= (select v_arrayElimArr_29 0) 1) (= (select .cse53 |c_~#dec_flag~0.base|) .cse49) (= (select .cse54 |c_~#dec_flag~0.base|) .cse49) (= v_DerPreprocessor_10 (select .cse54 |c_~#value~0.base|)) (= (select .cse52 |c_~#dec_flag~0.base|) .cse49) (= v_DerPreprocessor_46 (select .cse53 |c_~#value~0.base|)) (= (select .cse48 |c_~#dec_flag~0.base|) .cse49)))))) .cse56) (and .cse57 (or (and .cse46 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_28) |c_~#dec_flag~0.base| v_DerPreprocessor_29) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse62 (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse58 |c_~#value~0.base|)) |c_~#dec_flag~0.base| v_DerPreprocessor_26) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse55))) (let ((.cse61 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse62 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse55) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse55) |c_~#value~0.base|)))) (let ((.cse60 (store (store .cse61 |c_~#dec_flag~0.base| v_DerPreprocessor_13) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse59 (select .cse60 |c_~#value~0.base|))) (and (= (select .cse58 |c_~#dec_flag~0.base|) v_DerPreprocessor_29) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse59 0)) (= v_DerPreprocessor_13 (select .cse60 |c_~#dec_flag~0.base|)) (= v_DerPreprocessor_16 (select (store (store .cse61 |c_~#dec_flag~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (store .cse59 0 1)) |c_~#dec_flag~0.base|)) (= (select v_DerPreprocessor_30 0) 1) (= v_DerPreprocessor_26 (select .cse62 |c_~#dec_flag~0.base|))))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse63 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse55))) (and (= .cse4 (select .cse63 |c_~#value~0.base|)) (= v_DerPreprocessor_9 (select .cse63 |c_~#dec_flag~0.base|))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_31) |c_~#value~0.base| v_DerPreprocessor_32) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse55))) (and (= (select .cse64 |c_~#value~0.base|) .cse4) (= (select .cse64 |c_~#dec_flag~0.base|) v_DerPreprocessor_31)))) .cse65) (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse71 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_39) |c_~#dec_flag~0.base| v_DerPreprocessor_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse70 (store |c_#memory_int| |c_~#value~0.base| (select .cse71 |c_~#value~0.base|)))) (let ((.cse67 (store (store .cse70 |c_~#dec_flag~0.base| v_DerPreprocessor_34) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7))) (let ((.cse68 (store |c_#memory_int| |c_~#value~0.base| (select .cse67 |c_~#value~0.base|)))) (let ((.cse69 (store (store .cse68 |c_~#dec_flag~0.base| (select .cse71 |c_~#dec_flag~0.base|)) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_41))) (let ((.cse66 (select .cse69 |c_~#value~0.base|))) (and (= (select v_DerPreprocessor_41 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse66 0)) (= .cse67 (store (store .cse68 |c_~#dec_flag~0.base| .cse7) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7)) (= (select .cse69 |c_~#dec_flag~0.base|) .cse7) (= (select (store (store .cse68 |c_~#dec_flag~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (store .cse66 0 1)) |c_~#dec_flag~0.base|) .cse7) (= (select (store (store .cse70 |c_~#dec_flag~0.base| v_DerPreprocessor_37) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7) |c_~#dec_flag~0.base|) .cse7))))))))) .cse46 .cse22 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse72 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_9) |c_~#value~0.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse55))) (and (= .cse4 (select .cse72 |c_~#value~0.base|)) (= (select .cse72 |c_~#dec_flag~0.base|) .cse7)))) .cse73 (exists ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int))) (let ((.cse74 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_42) |c_~#value~0.base| v_DerPreprocessor_43) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7))) (and (= .cse4 (select .cse74 |c_~#value~0.base|)) (= (select .cse74 |c_~#dec_flag~0.base|) .cse7))))))))) (and .cse34 (let ((.cse80 (select .cse55 |c_~#value~0.offset|))) (or (and .cse46 (exists ((v_DerPreprocessor_127 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_DerPreprocessor_125 (Array Int Int)) (v_DerPreprocessor_114 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (v_DerPreprocessor_115 (Array Int Int)) (v_DerPreprocessor_123 (Array Int Int)) (v_DerPreprocessor_124 (Array Int Int)) (v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_122 (Array Int Int)) (v_DerPreprocessor_130 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_arrayElimArr_40 (Array Int Int)) (v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_129 (Array Int Int))) (let ((.cse84 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_126) |c_~#value~0.base| v_DerPreprocessor_127) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_40))) (let ((.cse76 (select .cse84 |c_~#dec_flag~0.base|))) (let ((.cse77 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_60) |c_~#dec_flag~0.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_62)) (.cse81 (select v_DerPreprocessor_125 |c_~#value~0.offset|)) (.cse82 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_120) |c_~#value~0.base| v_DerPreprocessor_121) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_122)) (.cse79 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_117) |c_~#value~0.base| v_DerPreprocessor_118) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_39)) (.cse78 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_114) |c_~#value~0.base| v_DerPreprocessor_115) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse76)) (.cse85 (select v_DerPreprocessor_62 |c_~#value~0.offset|)) (.cse83 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_129) |c_~#dec_flag~0.base| v_DerPreprocessor_130) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse76)) (.cse75 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_123) |c_~#dec_flag~0.base| v_DerPreprocessor_124) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_125))) (and (= (select .cse75 |c_~#dec_flag~0.base|) .cse76) (= v_DerPreprocessor_60 (select .cse77 |c_~#value~0.base|)) (= v_DerPreprocessor_115 (select .cse78 |c_~#value~0.base|)) (= (select .cse77 |c_~#dec_flag~0.base|) .cse76) (= .cse76 (select .cse79 |c_~#dec_flag~0.base|)) (= .cse80 .cse81) (= .cse76 (select .cse82 |c_~#dec_flag~0.base|)) (= (select v_DerPreprocessor_122 |c_~#value~0.offset|) (select v_arrayElimArr_39 |c_~#value~0.offset|)) (= v_arrayElimArr_40 (store (store v_DerPreprocessor_122 |c_~#value~0.offset| (select v_arrayElimArr_40 |c_~#value~0.offset|)) 0 1)) (= v_DerPreprocessor_125 (store (store v_arrayElimArr_39 |c_~#value~0.offset| .cse81) 0 1)) (= (select .cse83 |c_~#dec_flag~0.base|) .cse76) (= v_DerPreprocessor_121 (select .cse82 |c_~#value~0.base|)) (= v_DerPreprocessor_118 (select .cse79 |c_~#value~0.base|)) (= 1 (select v_arrayElimArr_39 0)) (= (select .cse84 |c_~#value~0.base|) v_DerPreprocessor_127) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| .cse85) (= .cse76 (select .cse78 |c_~#dec_flag~0.base|)) (= (store (store .cse55 |c_~#value~0.offset| .cse85) 0 1) v_DerPreprocessor_62) (= (select v_DerPreprocessor_122 0) 1) (= (select .cse76 0) 1) (= (select .cse83 |c_~#value~0.base|) v_DerPreprocessor_129) (= .cse76 .cse7) (= v_DerPreprocessor_123 (select .cse75 |c_~#value~0.base|))))))) .cse56) (and (or (and (or (exists ((v_prenex_270 (Array Int Int)) (v_prenex_220 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_267 (Array Int Int)) (v_prenex_268 (Array Int Int)) (v_prenex_269 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_219 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse92 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_96) |c_~#dec_flag~0.base| v_DerPreprocessor_97) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_98))) (let ((.cse87 (select .cse92 |c_~#dec_flag~0.base|))) (let ((.cse91 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse92 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse87) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse87) |c_~#value~0.base|)))) (let ((.cse88 (store (store .cse91 |c_~#dec_flag~0.base| v_prenex_270) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_267))) (let ((.cse86 (select .cse88 |c_~#value~0.base|)) (.cse89 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_87) |c_~#value~0.base| v_DerPreprocessor_88) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse87)) (.cse90 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_221) |c_~#value~0.base| v_prenex_219) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_220))) (and (= .cse55 (store (store v_prenex_220 |c_~#value~0.offset| .cse80) 0 1)) (= v_prenex_269 (store (store .cse86 |c_~#value~0.offset| (select v_prenex_269 |c_~#value~0.offset|)) 0 1)) (= .cse87 .cse7) (= .cse87 v_DerPreprocessor_98) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse86 |c_~#value~0.offset|)) (= .cse87 (select .cse88 |c_~#dec_flag~0.base|)) (= (select v_prenex_220 0) 1) (= .cse87 (select .cse89 |c_~#dec_flag~0.base|)) (= .cse4 (select .cse89 |c_~#value~0.base|)) (= (select .cse87 0) 1) (= .cse87 (select .cse90 |c_~#dec_flag~0.base|)) (= (select (store (store .cse91 |c_~#dec_flag~0.base| v_prenex_268) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_269) |c_~#dec_flag~0.base|) .cse87) (= .cse4 (select .cse90 |c_~#value~0.base|)) (= (select v_prenex_267 0) 1)))))))) (exists ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_273 (Array Int Int)) (v_arrayElimArr_38 (Array Int Int)) (v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse98 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_93) |c_~#dec_flag~0.base| v_DerPreprocessor_94) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_95))) (let ((.cse93 (select .cse98 |c_~#dec_flag~0.base|))) (let ((.cse96 (store |c_#memory_int| |c_~#value~0.base| (select (store (store (store |c_#memory_int| |c_~#value~0.base| (select .cse98 |c_~#value~0.base|)) |c_~#dec_flag~0.base| .cse93) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse93) |c_~#value~0.base|)))) (let ((.cse95 (store (store .cse96 |c_~#dec_flag~0.base| v_DerPreprocessor_61) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_33))) (let ((.cse94 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_69) |c_~#value~0.base| v_DerPreprocessor_70) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_38)) (.cse97 (select .cse95 |c_~#value~0.base|))) (and (= .cse55 .cse93) (= .cse93 .cse7) (= .cse4 (select .cse94 |c_~#value~0.base|)) (= (select .cse94 |c_~#dec_flag~0.base|) .cse93) (= .cse4 (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_272) |c_~#value~0.base| v_prenex_273) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse93) |c_~#value~0.base|)) (= (select v_arrayElimArr_33 0) 1) (= (select v_arrayElimArr_38 0) 1) (= (select .cse95 |c_~#dec_flag~0.base|) .cse93) (= (select (store (store .cse96 |c_~#dec_flag~0.base| v_DerPreprocessor_73) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_271) |c_~#dec_flag~0.base|) .cse93) (= v_DerPreprocessor_95 .cse93) (= (store (store .cse97 |c_~#value~0.offset| (select v_prenex_271 |c_~#value~0.offset|)) 0 1) v_prenex_271) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse97 |c_~#value~0.offset|)) (= (store (store v_arrayElimArr_38 |c_~#value~0.offset| (select .cse93 |c_~#value~0.offset|)) 0 1) .cse93))))))))) .cse73) (and (or (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse100 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse99 (select .cse100 |c_~#dec_flag~0.base|))) (and (= .cse99 v_prenex_41) (= .cse4 (select .cse100 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse106 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse102 (select .cse106 |c_~#dec_flag~0.base|))) (let ((.cse101 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse102)) (.cse104 (store |c_#memory_int| |c_~#value~0.base| (select .cse106 |c_~#value~0.base|)))) (and (= .cse4 (select .cse101 |c_~#value~0.base|)) (= (select .cse102 0) 1) (= (select .cse101 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (exists ((v_prenex_262 (Array Int Int)) (v_prenex_263 (Array Int Int)) (v_prenex_264 (Array Int Int)) (v_prenex_265 (Array Int Int))) (let ((.cse105 (store (store .cse104 |c_~#dec_flag~0.base| v_prenex_265) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_263))) (let ((.cse103 (select .cse105 |c_~#value~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse103 |c_~#value~0.offset|)) (= (select v_prenex_263 0) 1) (= (select (store (store .cse104 |c_~#dec_flag~0.base| v_prenex_264) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_262) |c_~#dec_flag~0.base|) v_prenex_264) (= (store (store .cse103 |c_~#value~0.offset| (select v_prenex_262 |c_~#value~0.offset|)) 0 1) v_prenex_262) (= (select .cse105 |c_~#dec_flag~0.base|) v_prenex_265))))) (= .cse102 .cse7) (= .cse99 .cse102) (= v_DerPreprocessor_100 .cse102) (= v_DerPreprocessor_84 (select (store (store .cse104 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse102) |c_~#dec_flag~0.base|))))))))))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse107 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse107 |c_~#dec_flag~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse115 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse109 (select .cse115 |c_~#dec_flag~0.base|))) (let ((.cse108 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse109)) (.cse113 (store |c_#memory_int| |c_~#value~0.base| (select .cse115 |c_~#value~0.base|)))) (and (= .cse4 (select .cse108 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse109 |c_~#value~0.offset|)) 0 1) .cse109) (= (select .cse108 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse109 .cse7) (exists ((v_prenex_257 (Array Int Int)) (v_prenex_258 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_259 (Array Int Int))) (let ((.cse114 (store (store .cse113 |c_~#dec_flag~0.base| v_prenex_259) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_258))) (let ((.cse111 (select .cse114 |c_~#dec_flag~0.base|)) (.cse112 (select .cse114 |c_~#value~0.base|)) (.cse110 (select (store (store .cse113 |c_~#dec_flag~0.base| v_prenex_39) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_257) |c_~#dec_flag~0.base|))) (and (= .cse110 .cse109) (= .cse111 .cse109) (= .cse111 v_prenex_259) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse112 |c_~#value~0.offset|)) (= (store (store .cse112 |c_~#value~0.offset| (select v_prenex_257 |c_~#value~0.offset|)) 0 1) v_prenex_257) (= .cse110 v_prenex_39))))) (= v_DerPreprocessor_100 .cse109) (= v_DerPreprocessor_84 (select (store (store .cse113 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse109) |c_~#dec_flag~0.base|))))))) (= (select .cse107 |c_~#value~0.base|) .cse4) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse116 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse116 |c_~#dec_flag~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse123 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse118 (select .cse123 |c_~#dec_flag~0.base|))) (let ((.cse117 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse118)) (.cse121 (store |c_#memory_int| |c_~#value~0.base| (select .cse123 |c_~#value~0.base|)))) (and (= .cse4 (select .cse117 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse118 |c_~#value~0.offset|)) 0 1) .cse118) (exists ((v_DerPreprocessor_74 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse122 (store (store .cse121 |c_~#dec_flag~0.base| v_prenex_45) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_34))) (let ((.cse119 (select .cse122 |c_~#value~0.base|)) (.cse120 (select .cse122 |c_~#dec_flag~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse119 |c_~#value~0.offset|)) (= v_prenex_45 .cse120) (= (store (store .cse119 |c_~#value~0.offset| (select v_DerPreprocessor_74 |c_~#value~0.offset|)) 0 1) v_DerPreprocessor_74) (= .cse120 .cse118) (= (select (store (store .cse121 |c_~#dec_flag~0.base| v_prenex_43) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_74) |c_~#dec_flag~0.base|) v_prenex_43))))) (= (select .cse117 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse118 .cse7) (= v_DerPreprocessor_100 .cse118) (= v_DerPreprocessor_84 (select (store (store .cse121 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse118) |c_~#dec_flag~0.base|))))))) (= (select .cse116 |c_~#value~0.base|) .cse4) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse133 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse131 (select .cse133 |c_~#dec_flag~0.base|))) (and (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse132 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse125 (select .cse132 |c_~#dec_flag~0.base|))) (let ((.cse124 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse125)) (.cse129 (store |c_#memory_int| |c_~#value~0.base| (select .cse132 |c_~#value~0.base|)))) (and (= .cse4 (select .cse124 |c_~#value~0.base|)) (= (select .cse124 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse125 .cse7) (exists ((v_prenex_257 (Array Int Int)) (v_prenex_258 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_259 (Array Int Int))) (let ((.cse130 (store (store .cse129 |c_~#dec_flag~0.base| v_prenex_259) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_258))) (let ((.cse127 (select .cse130 |c_~#dec_flag~0.base|)) (.cse128 (select .cse130 |c_~#value~0.base|)) (.cse126 (select (store (store .cse129 |c_~#dec_flag~0.base| v_prenex_39) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_257) |c_~#dec_flag~0.base|))) (and (= .cse126 .cse125) (= .cse127 .cse125) (= .cse127 v_prenex_259) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse128 |c_~#value~0.offset|)) (= (store (store .cse128 |c_~#value~0.offset| (select v_prenex_257 |c_~#value~0.offset|)) 0 1) v_prenex_257) (= .cse126 v_prenex_39))))) (= .cse131 .cse125) (= v_DerPreprocessor_100 .cse125) (= v_DerPreprocessor_84 (select (store (store .cse129 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse125) |c_~#dec_flag~0.base|))))))) (= .cse131 v_prenex_41) (= .cse4 (select .cse133 |c_~#value~0.base|)))))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse134 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse134 |c_~#dec_flag~0.base|)) (= (select .cse134 |c_~#value~0.base|) .cse4) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse141 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse136 (select .cse141 |c_~#dec_flag~0.base|))) (let ((.cse135 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse136)) (.cse140 (store |c_#memory_int| |c_~#value~0.base| (select .cse141 |c_~#value~0.base|)))) (and (= .cse4 (select .cse135 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse136 |c_~#value~0.offset|)) 0 1) .cse136) (exists ((v_arrayElimArr_35 (Array Int Int)) (v_prenex_260 (Array Int Int)) (v_prenex_261 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse139 (store (store .cse140 |c_~#dec_flag~0.base| v_prenex_38) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_35))) (let ((.cse137 (select (store (store .cse140 |c_~#dec_flag~0.base| v_prenex_261) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_260) |c_~#dec_flag~0.base|)) (.cse138 (select .cse139 |c_~#value~0.base|))) (and (= .cse137 .cse136) (= (select v_arrayElimArr_35 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse138 |c_~#value~0.offset|)) (= v_prenex_261 .cse137) (= v_prenex_260 (store (store .cse138 |c_~#value~0.offset| (select v_prenex_260 |c_~#value~0.offset|)) 0 1)) (= v_prenex_38 (select .cse139 |c_~#dec_flag~0.base|)))))) (= (select .cse135 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse136 .cse7) (= v_DerPreprocessor_100 .cse136) (= v_DerPreprocessor_84 (select (store (store .cse140 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse136) |c_~#dec_flag~0.base|))))))) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_37 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse142 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_46) |c_~#value~0.base| v_prenex_44) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_37))) (and (= v_prenex_46 (select .cse142 |c_~#dec_flag~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse148 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse144 (select .cse148 |c_~#dec_flag~0.base|))) (let ((.cse143 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse144)) (.cse146 (store |c_#memory_int| |c_~#value~0.base| (select .cse148 |c_~#value~0.base|)))) (and (= .cse4 (select .cse143 |c_~#value~0.base|)) (= (store (store v_arrayElimArr_37 |c_~#value~0.offset| (select .cse144 |c_~#value~0.offset|)) 0 1) .cse144) (= (select .cse143 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (exists ((v_prenex_262 (Array Int Int)) (v_prenex_263 (Array Int Int)) (v_prenex_264 (Array Int Int)) (v_prenex_265 (Array Int Int))) (let ((.cse147 (store (store .cse146 |c_~#dec_flag~0.base| v_prenex_265) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_263))) (let ((.cse145 (select .cse147 |c_~#value~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse145 |c_~#value~0.offset|)) (= (select v_prenex_263 0) 1) (= (select (store (store .cse146 |c_~#dec_flag~0.base| v_prenex_264) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_262) |c_~#dec_flag~0.base|) v_prenex_264) (= (store (store .cse145 |c_~#value~0.offset| (select v_prenex_262 |c_~#value~0.offset|)) 0 1) v_prenex_262) (= (select .cse147 |c_~#dec_flag~0.base|) v_prenex_265))))) (= .cse144 .cse7) (= v_DerPreprocessor_100 .cse144) (= v_DerPreprocessor_84 (select (store (store .cse146 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse144) |c_~#dec_flag~0.base|))))))) (= (select .cse142 |c_~#value~0.base|) .cse4) (= (select v_arrayElimArr_37 0) 1)))) (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse150 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse149 (select .cse150 |c_~#dec_flag~0.base|))) (and (= .cse149 v_prenex_41) (= .cse4 (select .cse150 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse157 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse154 (select .cse157 |c_~#dec_flag~0.base|))) (let ((.cse151 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse154)) (.cse155 (store |c_#memory_int| |c_~#value~0.base| (select .cse157 |c_~#value~0.base|)))) (and (= .cse4 (select .cse151 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_74 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse156 (store (store .cse155 |c_~#dec_flag~0.base| v_prenex_45) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_34))) (let ((.cse152 (select .cse156 |c_~#value~0.base|)) (.cse153 (select .cse156 |c_~#dec_flag~0.base|))) (and (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse152 |c_~#value~0.offset|)) (= v_prenex_45 .cse153) (= (store (store .cse152 |c_~#value~0.offset| (select v_DerPreprocessor_74 |c_~#value~0.offset|)) 0 1) v_DerPreprocessor_74) (= .cse153 .cse154) (= (select (store (store .cse155 |c_~#dec_flag~0.base| v_prenex_43) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_74) |c_~#dec_flag~0.base|) v_prenex_43))))) (= (select .cse154 0) 1) (= (select .cse151 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse154 .cse7) (= .cse149 .cse154) (= v_DerPreprocessor_100 .cse154) (= v_DerPreprocessor_84 (select (store (store .cse155 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse154) |c_~#dec_flag~0.base|))))))))))) (exists ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse159 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_prenex_41) |c_~#value~0.base| v_prenex_40) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_36))) (let ((.cse158 (select .cse159 |c_~#dec_flag~0.base|))) (and (= .cse158 v_prenex_41) (= .cse4 (select .cse159 |c_~#value~0.base|)) (exists ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (let ((.cse166 (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_99) |c_~#dec_flag~0.base| v_DerPreprocessor_100) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_101))) (let ((.cse162 (select .cse166 |c_~#dec_flag~0.base|))) (let ((.cse160 (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_DerPreprocessor_75) |c_~#value~0.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse162)) (.cse165 (store |c_#memory_int| |c_~#value~0.base| (select .cse166 |c_~#value~0.base|)))) (and (= .cse4 (select .cse160 |c_~#value~0.base|)) (exists ((v_arrayElimArr_35 (Array Int Int)) (v_prenex_260 (Array Int Int)) (v_prenex_261 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse164 (store (store .cse165 |c_~#dec_flag~0.base| v_prenex_38) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_arrayElimArr_35))) (let ((.cse161 (select (store (store .cse165 |c_~#dec_flag~0.base| v_prenex_261) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_prenex_260) |c_~#dec_flag~0.base|)) (.cse163 (select .cse164 |c_~#value~0.base|))) (and (= .cse161 .cse162) (= (select v_arrayElimArr_35 0) 1) (= |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1| (select .cse163 |c_~#value~0.offset|)) (= v_prenex_261 .cse161) (= v_prenex_260 (store (store .cse163 |c_~#value~0.offset| (select v_prenex_260 |c_~#value~0.offset|)) 0 1)) (= v_prenex_38 (select .cse164 |c_~#dec_flag~0.base|)))))) (= (select .cse160 |c_~#dec_flag~0.base|) v_DerPreprocessor_75) (= .cse162 .cse7) (= .cse158 .cse162) (= v_DerPreprocessor_100 .cse162) (= v_DerPreprocessor_84 (select (store (store .cse165 |c_~#dec_flag~0.base| v_DerPreprocessor_84) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse162) |c_~#dec_flag~0.base|)))))))))))) .cse65)) .cse57))))))) (<= |c_~#value~0.base| 3) (= |c_~#dec_flag~0.offset| 0))))) is different from true [2024-10-18 00:17:50,192 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-10-18 00:18:36,402 WARN L286 SmtUtils]: Spent 32.07s on a formula simplification. DAG size of input: 464 DAG size of output: 466 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-18 00:18:46,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:18:51,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:18:53,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:18:57,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:18:58,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 00:18:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:18:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:18:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 00:18:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 00:18:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 00:18:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 00:18:59,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-18 00:18:59,238 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,SelfDestructingSolverStorable16 [2024-10-18 00:18:59,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:18:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:18:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -332509073, now seen corresponding path program 1 times [2024-10-18 00:18:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:18:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280868249] [2024-10-18 00:18:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:18:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:18:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:19:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:19:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:19:07,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280868249] [2024-10-18 00:19:07,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280868249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:19:07,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552352223] [2024-10-18 00:19:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:19:07,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:19:07,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:19:07,444 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-10-18 00:19:07,445 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-10-18 00:19:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:19:07,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-18 00:19:07,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:19:09,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-18 00:19:11,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:19:11,636 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-10-18 00:19:15,225 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-10-18 00:19:15,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 65 [2024-10-18 00:19:15,329 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-18 00:19:15,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 61 [2024-10-18 00:19:15,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2024-10-18 00:19:15,446 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 19 treesize of output 18 [2024-10-18 00:19:16,031 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-10-18 00:19:16,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 60 [2024-10-18 00:19:16,452 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-18 00:19:16,452 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 1 case distinctions, treesize of input 101 treesize of output 98 [2024-10-18 00:19:17,999 INFO L349 Elim1Store]: treesize reduction 40, result has 41.2 percent of original size [2024-10-18 00:19:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2024-10-18 00:19:18,124 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 17 treesize of output 16 [2024-10-18 00:19:18,712 INFO L349 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2024-10-18 00:19:18,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 40 [2024-10-18 00:19:33,700 INFO L349 Elim1Store]: treesize reduction 128, result has 25.6 percent of original size [2024-10-18 00:19:33,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 2585 treesize of output 2392 [2024-10-18 00:19:33,902 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 616 treesize of output 614 [2024-10-18 00:19:34,290 INFO L224 Elim1Store]: Index analysis took 297 ms [2024-10-18 00:19:36,464 INFO L349 Elim1Store]: treesize reduction 156, result has 23.2 percent of original size [2024-10-18 00:19:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 96 treesize of output 165 [2024-10-18 00:19:36,964 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-10-18 00:19:37,225 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 28 treesize of output 25 [2024-10-18 00:19:37,763 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-10-18 00:19:38,283 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-10-18 00:19:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2024-10-18 00:19:38,943 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-10-18 00:19:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2024-10-18 00:19:40,285 INFO L349 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2024-10-18 00:19:40,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 85 [2024-10-18 00:19:44,457 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 30 treesize of output 1 [2024-10-18 00:19:45,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 3 [2024-10-18 00:19:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 3 [2024-10-18 00:19:45,922 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-18 00:19:49,875 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 30 treesize of output 1 [2024-10-18 00:19:50,995 INFO L349 Elim1Store]: treesize reduction 43, result has 31.7 percent of original size [2024-10-18 00:19:50,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 27 Killed by 15