/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:52:32,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:52:32,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 01:52:32,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:52:32,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:52:32,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:52:32,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:52:32,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:52:32,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:52:32,288 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:52:32,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:52:32,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:52:32,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:52:32,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:52:32,290 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:52:32,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:52:32,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:52:32,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:52:32,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:52:32,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:52:32,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:52:32,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:52:32,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:52:32,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:52:32,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:52:32,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:52:32,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:52:32,293 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:52:32,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:52:32,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:52:32,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:52:32,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:52:32,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:52:32,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:52:32,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:52:32,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:52:32,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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: Use bitabs translation -> false [2023-12-21 01:52:32,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:52:32,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:52:32,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:52:32,491 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:52:32,495 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:52:32,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i [2023-12-21 01:52:33,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:52:33,694 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:52:33,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i [2023-12-21 01:52:33,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070404e32/49846452355f43e1a0bd1d6ee9eaeff7/FLAGbe635eef9 [2023-12-21 01:52:33,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070404e32/49846452355f43e1a0bd1d6ee9eaeff7 [2023-12-21 01:52:33,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:52:33,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:52:33,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:52:33,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:52:33,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:52:33,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:33,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f11da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33, skipping insertion in model container [2023-12-21 01:52:33,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:33,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:52:33,856 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i[917,930] [2023-12-21 01:52:33,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:52:33,901 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:52:33,908 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i[917,930] [2023-12-21 01:52:33,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:52:33,946 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:52:33,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33 WrapperNode [2023-12-21 01:52:33,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:52:33,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:52:33,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:52:33,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:52:33,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:33,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,013 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2023-12-21 01:52:34,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:52:34,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:52:34,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:52:34,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:52:34,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,050 INFO L175 MemorySlicer]: Split 123 memory accesses to 5 slices as follows [2, 16, 70, 11, 24]. 57 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 6, 1, 3]. The 16 writes are split as follows [0, 2, 8, 1, 5]. [2023-12-21 01:52:34,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:52:34,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:52:34,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:52:34,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:52:34,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (1/1) ... [2023-12-21 01:52:34,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:52:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:52:34,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 01:52:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:52:34,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 01:52:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:52:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:52:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:52:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:52:34,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:52:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:52:34,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:52:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:52:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:52:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:52:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:52:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:52:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:52:34,266 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:52:34,268 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:52:34,608 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:52:34,638 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:52:34,638 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:52:34,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:52:34 BoogieIcfgContainer [2023-12-21 01:52:34,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:52:34,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:52:34,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:52:34,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:52:34,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:52:33" (1/3) ... [2023-12-21 01:52:34,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2026e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:52:34, skipping insertion in model container [2023-12-21 01:52:34,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:52:33" (2/3) ... [2023-12-21 01:52:34,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2026e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:52:34, skipping insertion in model container [2023-12-21 01:52:34,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:52:34" (3/3) ... [2023-12-21 01:52:34,646 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-27.i [2023-12-21 01:52:34,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:52:34,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:52:34,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:52:34,695 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@4bbed188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:52:34,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:52:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:52:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 01:52:34,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:34,707 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:34,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:34,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1954445179, now seen corresponding path program 1 times [2023-12-21 01:52:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010141304] [2023-12-21 01:52:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:35,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010141304] [2023-12-21 01:52:35,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010141304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:35,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:35,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:52:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630172089] [2023-12-21 01:52:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:35,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:52:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:52:35,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:52:35,082 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:35,132 INFO L93 Difference]: Finished difference Result 171 states and 273 transitions. [2023-12-21 01:52:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:52:35,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2023-12-21 01:52:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:35,140 INFO L225 Difference]: With dead ends: 171 [2023-12-21 01:52:35,141 INFO L226 Difference]: Without dead ends: 85 [2023-12-21 01:52:35,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:52:35,146 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:35,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:52:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-21 01:52:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-21 01:52:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:52:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2023-12-21 01:52:35,192 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 126 [2023-12-21 01:52:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:35,193 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2023-12-21 01:52:35,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2023-12-21 01:52:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 01:52:35,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:35,200 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:35,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:52:35,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:35,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2107448995, now seen corresponding path program 1 times [2023-12-21 01:52:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395434667] [2023-12-21 01:52:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:35,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:35,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395434667] [2023-12-21 01:52:35,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395434667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:35,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:35,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:52:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314915149] [2023-12-21 01:52:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:35,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:52:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:52:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:52:35,676 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:35,775 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2023-12-21 01:52:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:52:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2023-12-21 01:52:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:35,779 INFO L225 Difference]: With dead ends: 214 [2023-12-21 01:52:35,779 INFO L226 Difference]: Without dead ends: 130 [2023-12-21 01:52:35,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:35,781 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 127 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:35,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 326 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:52:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-21 01:52:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 89. [2023-12-21 01:52:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:52:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2023-12-21 01:52:35,789 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 126 [2023-12-21 01:52:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:35,790 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2023-12-21 01:52:35,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2023-12-21 01:52:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 01:52:35,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:35,791 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:35,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:52:35,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:35,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 113304289, now seen corresponding path program 1 times [2023-12-21 01:52:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300450771] [2023-12-21 01:52:35,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:36,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300450771] [2023-12-21 01:52:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300450771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:36,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:36,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:52:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827525591] [2023-12-21 01:52:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:36,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:52:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:52:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:52:36,459 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:36,599 INFO L93 Difference]: Finished difference Result 237 states and 347 transitions. [2023-12-21 01:52:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:52:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2023-12-21 01:52:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:36,604 INFO L225 Difference]: With dead ends: 237 [2023-12-21 01:52:36,604 INFO L226 Difference]: Without dead ends: 149 [2023-12-21 01:52:36,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:36,608 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 60 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:36,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 390 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:52:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-21 01:52:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2023-12-21 01:52:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2023-12-21 01:52:36,638 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 126 [2023-12-21 01:52:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:36,640 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2023-12-21 01:52:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2023-12-21 01:52:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 01:52:36,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:36,643 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:36,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:52:36,643 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:36,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1888594277, now seen corresponding path program 1 times [2023-12-21 01:52:36,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:36,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705885711] [2023-12-21 01:52:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:36,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705885711] [2023-12-21 01:52:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705885711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:52:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987554506] [2023-12-21 01:52:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:36,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:52:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:52:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:52:36,897 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:36,960 INFO L93 Difference]: Finished difference Result 276 states and 401 transitions. [2023-12-21 01:52:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:52:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2023-12-21 01:52:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:36,963 INFO L225 Difference]: With dead ends: 276 [2023-12-21 01:52:36,963 INFO L226 Difference]: Without dead ends: 188 [2023-12-21 01:52:36,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:36,970 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 114 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:36,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 434 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:52:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-21 01:52:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2023-12-21 01:52:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2023-12-21 01:52:36,988 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 126 [2023-12-21 01:52:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:36,988 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2023-12-21 01:52:36,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2023-12-21 01:52:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-21 01:52:36,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:36,989 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:36,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:52:36,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:36,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1790875721, now seen corresponding path program 1 times [2023-12-21 01:52:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637167423] [2023-12-21 01:52:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:38,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637167423] [2023-12-21 01:52:38,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637167423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:38,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:38,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:52:38,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203500629] [2023-12-21 01:52:38,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:38,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:52:38,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:52:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:52:38,300 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:38,827 INFO L93 Difference]: Finished difference Result 330 states and 476 transitions. [2023-12-21 01:52:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:52:38,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 127 [2023-12-21 01:52:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:38,830 INFO L225 Difference]: With dead ends: 330 [2023-12-21 01:52:38,830 INFO L226 Difference]: Without dead ends: 229 [2023-12-21 01:52:38,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:52:38,833 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 222 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:38,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 616 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:52:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-21 01:52:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 207. [2023-12-21 01:52:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 166 states have internal predecessors, (221), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 01:52:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2023-12-21 01:52:38,857 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 127 [2023-12-21 01:52:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:38,858 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2023-12-21 01:52:38,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2023-12-21 01:52:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 01:52:38,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:38,859 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:38,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:52:38,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:38,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1597776678, now seen corresponding path program 1 times [2023-12-21 01:52:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77887912] [2023-12-21 01:52:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77887912] [2023-12-21 01:52:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77887912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:39,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:52:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863243636] [2023-12-21 01:52:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:39,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:52:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:52:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:52:39,122 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:39,317 INFO L93 Difference]: Finished difference Result 388 states and 552 transitions. [2023-12-21 01:52:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:52:39,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2023-12-21 01:52:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:39,319 INFO L225 Difference]: With dead ends: 388 [2023-12-21 01:52:39,319 INFO L226 Difference]: Without dead ends: 237 [2023-12-21 01:52:39,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:52:39,320 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 270 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:39,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 382 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:52:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-21 01:52:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 178. [2023-12-21 01:52:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2023-12-21 01:52:39,338 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 128 [2023-12-21 01:52:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:39,339 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2023-12-21 01:52:39,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2023-12-21 01:52:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-21 01:52:39,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:39,340 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:52:39,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:39,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1912820860, now seen corresponding path program 1 times [2023-12-21 01:52:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759503307] [2023-12-21 01:52:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:39,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:39,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759503307] [2023-12-21 01:52:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759503307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:39,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:52:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62772635] [2023-12-21 01:52:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:39,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:52:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:52:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:52:39,672 INFO L87 Difference]: Start difference. First operand 178 states and 249 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:39,908 INFO L93 Difference]: Finished difference Result 332 states and 465 transitions. [2023-12-21 01:52:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:52:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2023-12-21 01:52:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:39,910 INFO L225 Difference]: With dead ends: 332 [2023-12-21 01:52:39,910 INFO L226 Difference]: Without dead ends: 214 [2023-12-21 01:52:39,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:52:39,911 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 215 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:39,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 360 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:52:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-21 01:52:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 178. [2023-12-21 01:52:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 139 states have internal predecessors, (180), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 248 transitions. [2023-12-21 01:52:39,932 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 248 transitions. Word has length 129 [2023-12-21 01:52:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:39,932 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 248 transitions. [2023-12-21 01:52:39,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 248 transitions. [2023-12-21 01:52:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:39,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:39,933 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:39,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:52:39,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:39,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:39,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1472401365, now seen corresponding path program 1 times [2023-12-21 01:52:39,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:39,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614932918] [2023-12-21 01:52:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:40,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:40,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614932918] [2023-12-21 01:52:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614932918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:40,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:52:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560964404] [2023-12-21 01:52:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:40,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:52:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:52:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:52:40,997 INFO L87 Difference]: Start difference. First operand 178 states and 248 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:41,756 INFO L93 Difference]: Finished difference Result 371 states and 519 transitions. [2023-12-21 01:52:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:52:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2023-12-21 01:52:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:41,758 INFO L225 Difference]: With dead ends: 371 [2023-12-21 01:52:41,758 INFO L226 Difference]: Without dead ends: 253 [2023-12-21 01:52:41,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-12-21 01:52:41,759 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 406 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:41,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 783 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:52:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-21 01:52:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2023-12-21 01:52:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 154 states have internal predecessors, (200), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2023-12-21 01:52:41,794 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 130 [2023-12-21 01:52:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:41,795 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2023-12-21 01:52:41,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2023-12-21 01:52:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:41,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:41,796 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:41,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:52:41,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:41,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -771336787, now seen corresponding path program 1 times [2023-12-21 01:52:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:41,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016317310] [2023-12-21 01:52:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:42,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016317310] [2023-12-21 01:52:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016317310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:52:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785667181] [2023-12-21 01:52:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:52:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:52:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:52:42,846 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:43,496 INFO L93 Difference]: Finished difference Result 386 states and 538 transitions. [2023-12-21 01:52:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:52:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 130 [2023-12-21 01:52:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:43,498 INFO L225 Difference]: With dead ends: 386 [2023-12-21 01:52:43,498 INFO L226 Difference]: Without dead ends: 253 [2023-12-21 01:52:43,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-12-21 01:52:43,498 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 231 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:43,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 642 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:52:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-21 01:52:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2023-12-21 01:52:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 154 states have internal predecessors, (199), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 267 transitions. [2023-12-21 01:52:43,523 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 267 transitions. Word has length 130 [2023-12-21 01:52:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:43,524 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 267 transitions. [2023-12-21 01:52:43,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 267 transitions. [2023-12-21 01:52:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:43,524 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:43,525 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:52:43,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:43,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1133622189, now seen corresponding path program 1 times [2023-12-21 01:52:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:43,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002295179] [2023-12-21 01:52:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:43,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002295179] [2023-12-21 01:52:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002295179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:52:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384597669] [2023-12-21 01:52:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:44,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:52:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:52:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:52:44,330 INFO L87 Difference]: Start difference. First operand 193 states and 267 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:44,865 INFO L93 Difference]: Finished difference Result 362 states and 501 transitions. [2023-12-21 01:52:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:52:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2023-12-21 01:52:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:44,867 INFO L225 Difference]: With dead ends: 362 [2023-12-21 01:52:44,867 INFO L226 Difference]: Without dead ends: 229 [2023-12-21 01:52:44,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:52:44,868 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 320 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:44,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 443 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:52:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-21 01:52:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 193. [2023-12-21 01:52:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 266 transitions. [2023-12-21 01:52:44,893 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 266 transitions. Word has length 130 [2023-12-21 01:52:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:44,895 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 266 transitions. [2023-12-21 01:52:44,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 266 transitions. [2023-12-21 01:52:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:44,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:44,896 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:44,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:52:44,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:44,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1834686767, now seen corresponding path program 1 times [2023-12-21 01:52:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069979433] [2023-12-21 01:52:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069979433] [2023-12-21 01:52:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069979433] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 01:52:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988760322] [2023-12-21 01:52:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 01:52:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 01:52:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:52:45,632 INFO L87 Difference]: Start difference. First operand 193 states and 266 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:46,217 INFO L93 Difference]: Finished difference Result 362 states and 499 transitions. [2023-12-21 01:52:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:52:46,220 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 130 [2023-12-21 01:52:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:46,221 INFO L225 Difference]: With dead ends: 362 [2023-12-21 01:52:46,221 INFO L226 Difference]: Without dead ends: 229 [2023-12-21 01:52:46,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-21 01:52:46,222 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 248 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:46,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 839 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:52:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-21 01:52:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 190. [2023-12-21 01:52:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 151 states have internal predecessors, (194), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2023-12-21 01:52:46,242 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 130 [2023-12-21 01:52:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:46,243 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2023-12-21 01:52:46,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2023-12-21 01:52:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:46,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:46,244 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:46,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:52:46,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:46,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1121698273, now seen corresponding path program 1 times [2023-12-21 01:52:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337222813] [2023-12-21 01:52:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337222813] [2023-12-21 01:52:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337222813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:46,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:52:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526862467] [2023-12-21 01:52:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:46,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:52:46,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:46,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:52:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:52:46,433 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:46,508 INFO L93 Difference]: Finished difference Result 413 states and 570 transitions. [2023-12-21 01:52:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:52:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2023-12-21 01:52:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:46,510 INFO L225 Difference]: With dead ends: 413 [2023-12-21 01:52:46,510 INFO L226 Difference]: Without dead ends: 283 [2023-12-21 01:52:46,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:46,511 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 98 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:46,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 509 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:52:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-21 01:52:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 226. [2023-12-21 01:52:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 187 states have (on average 1.2780748663101604) internal successors, (239), 187 states have internal predecessors, (239), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:52:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 307 transitions. [2023-12-21 01:52:46,533 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 307 transitions. Word has length 130 [2023-12-21 01:52:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:46,533 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 307 transitions. [2023-12-21 01:52:46,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 307 transitions. [2023-12-21 01:52:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:46,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:46,534 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:46,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:52:46,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:46,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1514725283, now seen corresponding path program 1 times [2023-12-21 01:52:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847245101] [2023-12-21 01:52:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847245101] [2023-12-21 01:52:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847245101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-21 01:52:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543361573] [2023-12-21 01:52:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:48,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 01:52:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:48,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 01:52:48,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-12-21 01:52:48,277 INFO L87 Difference]: Start difference. First operand 226 states and 307 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:52:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:50,045 INFO L93 Difference]: Finished difference Result 607 states and 819 transitions. [2023-12-21 01:52:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 01:52:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2023-12-21 01:52:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:50,050 INFO L225 Difference]: With dead ends: 607 [2023-12-21 01:52:50,050 INFO L226 Difference]: Without dead ends: 443 [2023-12-21 01:52:50,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 01:52:50,052 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 599 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:50,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 665 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 01:52:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-12-21 01:52:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 315. [2023-12-21 01:52:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 266 states have (on average 1.281954887218045) internal successors, (341), 267 states have internal predecessors, (341), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 425 transitions. [2023-12-21 01:52:50,086 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 425 transitions. Word has length 130 [2023-12-21 01:52:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:50,086 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 425 transitions. [2023-12-21 01:52:50,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:52:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 425 transitions. [2023-12-21 01:52:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 01:52:50,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:50,088 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:50,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:52:50,088 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:50,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1374176673, now seen corresponding path program 1 times [2023-12-21 01:52:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948564504] [2023-12-21 01:52:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948564504] [2023-12-21 01:52:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948564504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:50,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:50,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:52:50,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235052908] [2023-12-21 01:52:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:50,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:52:50,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:52:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:52:50,273 INFO L87 Difference]: Start difference. First operand 315 states and 425 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:50,350 INFO L93 Difference]: Finished difference Result 579 states and 781 transitions. [2023-12-21 01:52:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:52:50,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2023-12-21 01:52:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:50,353 INFO L225 Difference]: With dead ends: 579 [2023-12-21 01:52:50,353 INFO L226 Difference]: Without dead ends: 331 [2023-12-21 01:52:50,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:50,354 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 113 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:50,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 455 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:52:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-12-21 01:52:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 312. [2023-12-21 01:52:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 263 states have (on average 1.2775665399239544) internal successors, (336), 264 states have internal predecessors, (336), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 420 transitions. [2023-12-21 01:52:50,384 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 420 transitions. Word has length 130 [2023-12-21 01:52:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:50,384 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 420 transitions. [2023-12-21 01:52:50,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 420 transitions. [2023-12-21 01:52:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:50,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:50,385 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:50,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:52:50,386 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:50,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1341429018, now seen corresponding path program 1 times [2023-12-21 01:52:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:50,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121133371] [2023-12-21 01:52:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:50,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:50,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121133371] [2023-12-21 01:52:50,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121133371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:50,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:50,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:52:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164247043] [2023-12-21 01:52:50,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:50,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:52:50,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:52:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:52:50,847 INFO L87 Difference]: Start difference. First operand 312 states and 420 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:51,370 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2023-12-21 01:52:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:52:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 01:52:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:51,374 INFO L225 Difference]: With dead ends: 877 [2023-12-21 01:52:51,374 INFO L226 Difference]: Without dead ends: 632 [2023-12-21 01:52:51,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-12-21 01:52:51,376 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 364 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:51,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 557 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:52:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-12-21 01:52:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 370. [2023-12-21 01:52:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 321 states have (on average 1.280373831775701) internal successors, (411), 322 states have internal predecessors, (411), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 495 transitions. [2023-12-21 01:52:51,409 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 495 transitions. Word has length 134 [2023-12-21 01:52:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:51,409 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 495 transitions. [2023-12-21 01:52:51,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 495 transitions. [2023-12-21 01:52:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:51,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:51,411 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:51,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:52:51,412 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:51,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2144191652, now seen corresponding path program 1 times [2023-12-21 01:52:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995704150] [2023-12-21 01:52:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995704150] [2023-12-21 01:52:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995704150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 01:52:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154348963] [2023-12-21 01:52:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:52,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 01:52:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 01:52:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:52:52,713 INFO L87 Difference]: Start difference. First operand 370 states and 495 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:54,395 INFO L93 Difference]: Finished difference Result 933 states and 1246 transitions. [2023-12-21 01:52:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 01:52:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2023-12-21 01:52:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:54,397 INFO L225 Difference]: With dead ends: 933 [2023-12-21 01:52:54,397 INFO L226 Difference]: Without dead ends: 630 [2023-12-21 01:52:54,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1016, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 01:52:54,399 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 474 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:54,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 905 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:52:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-12-21 01:52:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 470. [2023-12-21 01:52:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 421 states have (on average 1.2802850356294537) internal successors, (539), 422 states have internal predecessors, (539), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 623 transitions. [2023-12-21 01:52:54,433 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 623 transitions. Word has length 134 [2023-12-21 01:52:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:54,433 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 623 transitions. [2023-12-21 01:52:54,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 01:52:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 623 transitions. [2023-12-21 01:52:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:54,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:54,435 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:54,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:52:54,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:54,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1769339663, now seen corresponding path program 1 times [2023-12-21 01:52:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723691545] [2023-12-21 01:52:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723691545] [2023-12-21 01:52:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723691545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:54,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:52:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127710556] [2023-12-21 01:52:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:54,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:52:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:52:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:52:54,577 INFO L87 Difference]: Start difference. First operand 470 states and 623 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:54,645 INFO L93 Difference]: Finished difference Result 940 states and 1248 transitions. [2023-12-21 01:52:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:52:54,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 01:52:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:54,647 INFO L225 Difference]: With dead ends: 940 [2023-12-21 01:52:54,647 INFO L226 Difference]: Without dead ends: 537 [2023-12-21 01:52:54,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:54,648 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 114 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:54,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 357 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:52:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-12-21 01:52:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 486. [2023-12-21 01:52:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 437 states have (on average 1.2814645308924486) internal successors, (560), 438 states have internal predecessors, (560), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 644 transitions. [2023-12-21 01:52:54,689 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 644 transitions. Word has length 134 [2023-12-21 01:52:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:54,690 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 644 transitions. [2023-12-21 01:52:54,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 644 transitions. [2023-12-21 01:52:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:54,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:54,692 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:54,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:52:54,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:54,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 959993037, now seen corresponding path program 1 times [2023-12-21 01:52:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:54,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268975866] [2023-12-21 01:52:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268975866] [2023-12-21 01:52:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268975866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:52:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965030569] [2023-12-21 01:52:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:54,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:52:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:54,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:52:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:52:54,815 INFO L87 Difference]: Start difference. First operand 486 states and 644 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:54,876 INFO L93 Difference]: Finished difference Result 924 states and 1225 transitions. [2023-12-21 01:52:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:52:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 01:52:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:54,878 INFO L225 Difference]: With dead ends: 924 [2023-12-21 01:52:54,878 INFO L226 Difference]: Without dead ends: 505 [2023-12-21 01:52:54,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:52:54,880 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 49 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:54,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 563 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:52:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-12-21 01:52:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 487. [2023-12-21 01:52:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 438 states have (on average 1.2808219178082192) internal successors, (561), 439 states have internal predecessors, (561), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 645 transitions. [2023-12-21 01:52:54,914 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 645 transitions. Word has length 134 [2023-12-21 01:52:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:54,914 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 645 transitions. [2023-12-21 01:52:54,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 645 transitions. [2023-12-21 01:52:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:54,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:54,915 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:54,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:52:54,916 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:54,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1403468632, now seen corresponding path program 1 times [2023-12-21 01:52:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61002844] [2023-12-21 01:52:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61002844] [2023-12-21 01:52:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61002844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:55,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:52:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949525878] [2023-12-21 01:52:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:55,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:52:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:52:55,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:52:55,621 INFO L87 Difference]: Start difference. First operand 487 states and 645 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:56,471 INFO L93 Difference]: Finished difference Result 1164 states and 1534 transitions. [2023-12-21 01:52:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:52:56,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2023-12-21 01:52:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:56,474 INFO L225 Difference]: With dead ends: 1164 [2023-12-21 01:52:56,474 INFO L226 Difference]: Without dead ends: 744 [2023-12-21 01:52:56,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-21 01:52:56,475 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 300 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:56,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 750 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:52:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-12-21 01:52:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 546. [2023-12-21 01:52:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 497 states have (on average 1.2857142857142858) internal successors, (639), 498 states have internal predecessors, (639), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 723 transitions. [2023-12-21 01:52:56,510 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 723 transitions. Word has length 134 [2023-12-21 01:52:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:56,510 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 723 transitions. [2023-12-21 01:52:56,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:52:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 723 transitions. [2023-12-21 01:52:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:56,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:56,511 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 01:52:56,511 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:56,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2082152038, now seen corresponding path program 1 times [2023-12-21 01:52:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169566547] [2023-12-21 01:52:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169566547] [2023-12-21 01:52:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169566547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:52:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013343263] [2023-12-21 01:52:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:56,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:52:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:52:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:52:56,823 INFO L87 Difference]: Start difference. First operand 546 states and 723 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:57,172 INFO L93 Difference]: Finished difference Result 1238 states and 1635 transitions. [2023-12-21 01:52:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:52:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 01:52:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:57,174 INFO L225 Difference]: With dead ends: 1238 [2023-12-21 01:52:57,174 INFO L226 Difference]: Without dead ends: 757 [2023-12-21 01:52:57,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:52:57,175 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 248 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:57,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 554 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:52:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-12-21 01:52:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 658. [2023-12-21 01:52:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 609 states have (on average 1.2824302134646963) internal successors, (781), 610 states have internal predecessors, (781), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 865 transitions. [2023-12-21 01:52:57,211 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 865 transitions. Word has length 134 [2023-12-21 01:52:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:57,212 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 865 transitions. [2023-12-21 01:52:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:52:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 865 transitions. [2023-12-21 01:52:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:57,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:57,213 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:57,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 01:52:57,213 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:57,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash -980766806, now seen corresponding path program 1 times [2023-12-21 01:52:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353914986] [2023-12-21 01:52:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:52:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:52:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:52:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:52:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:52:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:52:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:52:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:52:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:52:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:52:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:52:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:52:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:52:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:52:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:52:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:52:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:52:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:52:57,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:52:57,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353914986] [2023-12-21 01:52:57,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353914986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:52:57,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:52:57,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 01:52:57,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800106513] [2023-12-21 01:52:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:52:57,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 01:52:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:52:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 01:52:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:52:57,941 INFO L87 Difference]: Start difference. First operand 658 states and 865 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:52:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:52:58,808 INFO L93 Difference]: Finished difference Result 1328 states and 1742 transitions. [2023-12-21 01:52:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 01:52:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2023-12-21 01:52:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:52:58,811 INFO L225 Difference]: With dead ends: 1328 [2023-12-21 01:52:58,811 INFO L226 Difference]: Without dead ends: 737 [2023-12-21 01:52:58,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2023-12-21 01:52:58,812 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 344 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:52:58,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1134 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:52:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-12-21 01:52:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 658. [2023-12-21 01:52:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 609 states have (on average 1.2824302134646963) internal successors, (781), 610 states have internal predecessors, (781), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:52:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 865 transitions. [2023-12-21 01:52:58,869 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 865 transitions. Word has length 134 [2023-12-21 01:52:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:52:58,869 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 865 transitions. [2023-12-21 01:52:58,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:52:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 865 transitions. [2023-12-21 01:52:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:52:58,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:52:58,871 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:52:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 01:52:58,871 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:52:58,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:52:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2121307972, now seen corresponding path program 1 times [2023-12-21 01:52:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:52:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296847171] [2023-12-21 01:52:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:52:58,886 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:52:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189908454] [2023-12-21 01:52:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:52:58,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:52:58,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:52:58,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:52:58,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 01:52:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:52:59,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-21 01:52:59,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:52:59,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 01:53:00,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 01:53:01,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,052 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-12-21 01:53:01,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-12-21 01:53:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,161 INFO L349 Elim1Store]: treesize reduction 65, result has 18.8 percent of original size [2023-12-21 01:53:01,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 52 [2023-12-21 01:53:01,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:01,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2023-12-21 01:53:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 283 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-21 01:53:01,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:53:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296847171] [2023-12-21 01:53:05,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:53:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189908454] [2023-12-21 01:53:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189908454] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:53:05,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:53:05,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-12-21 01:53:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775105966] [2023-12-21 01:53:05,690 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 01:53:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 01:53:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 01:53:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=284, Unknown=1, NotChecked=0, Total=342 [2023-12-21 01:53:05,691 INFO L87 Difference]: Start difference. First operand 658 states and 865 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:53:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:07,042 INFO L93 Difference]: Finished difference Result 1602 states and 2071 transitions. [2023-12-21 01:53:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 01:53:07,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2023-12-21 01:53:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:07,046 INFO L225 Difference]: With dead ends: 1602 [2023-12-21 01:53:07,046 INFO L226 Difference]: Without dead ends: 1011 [2023-12-21 01:53:07,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=280, Invalid=909, Unknown=1, NotChecked=0, Total=1190 [2023-12-21 01:53:07,048 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 389 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:07,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 407 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:53:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-12-21 01:53:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 843. [2023-12-21 01:53:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 775 states have (on average 1.2683870967741935) internal successors, (983), 778 states have internal predecessors, (983), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:53:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1091 transitions. [2023-12-21 01:53:07,109 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1091 transitions. Word has length 134 [2023-12-21 01:53:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:07,109 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1091 transitions. [2023-12-21 01:53:07,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:53:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1091 transitions. [2023-12-21 01:53:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:53:07,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:07,111 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:53:07,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 01:53:07,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-21 01:53:07,317 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:07,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:07,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1311961346, now seen corresponding path program 1 times [2023-12-21 01:53:07,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:07,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14043713] [2023-12-21 01:53:07,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:07,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:07,345 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:53:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648005422] [2023-12-21 01:53:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:07,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:53:07,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:53:07,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:53:07,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 01:53:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:07,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 01:53:07,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:53:09,426 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2023-12-21 01:53:09,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2023-12-21 01:53:09,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:09,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-12-21 01:53:09,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:09,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:09,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:09,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2023-12-21 01:53:09,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:09,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-21 01:53:09,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:09,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-12-21 01:53:09,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 01:53:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:53:09,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:53:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14043713] [2023-12-21 01:53:09,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:53:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648005422] [2023-12-21 01:53:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648005422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:53:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129714760] [2023-12-21 01:53:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:09,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:53:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:09,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:53:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:53:09,917 INFO L87 Difference]: Start difference. First operand 843 states and 1091 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:53:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:11,029 INFO L93 Difference]: Finished difference Result 1875 states and 2424 transitions. [2023-12-21 01:53:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:53:11,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 01:53:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:11,034 INFO L225 Difference]: With dead ends: 1875 [2023-12-21 01:53:11,034 INFO L226 Difference]: Without dead ends: 1107 [2023-12-21 01:53:11,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:53:11,035 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 250 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 32 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:11,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 511 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 656 Invalid, 3 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 01:53:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2023-12-21 01:53:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 750. [2023-12-21 01:53:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 682 states have (on average 1.2609970674486803) internal successors, (860), 685 states have internal predecessors, (860), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:53:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 968 transitions. [2023-12-21 01:53:11,114 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 968 transitions. Word has length 134 [2023-12-21 01:53:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:11,114 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 968 transitions. [2023-12-21 01:53:11,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:53:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 968 transitions. [2023-12-21 01:53:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:53:11,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:11,115 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:53:11,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 01:53:11,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-21 01:53:11,318 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:11,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash 937109357, now seen corresponding path program 1 times [2023-12-21 01:53:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568873387] [2023-12-21 01:53:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:11,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:11,334 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:53:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203736641] [2023-12-21 01:53:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:11,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:53:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:53:11,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:53:11,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 01:53:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:11,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 01:53:11,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:53:12,401 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-21 01:53:12,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 01:53:12,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:12,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:12,443 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 01:53:12,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2023-12-21 01:53:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 01:53:12,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:53:12,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-12-21 01:53:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:53:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568873387] [2023-12-21 01:53:13,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:53:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203736641] [2023-12-21 01:53:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203736641] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:53:13,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:53:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2023-12-21 01:53:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189849443] [2023-12-21 01:53:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:53:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:13,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:53:13,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:53:13,312 INFO L87 Difference]: Start difference. First operand 750 states and 968 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:53:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:13,936 INFO L93 Difference]: Finished difference Result 1568 states and 2024 transitions. [2023-12-21 01:53:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:53:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 01:53:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:13,940 INFO L225 Difference]: With dead ends: 1568 [2023-12-21 01:53:13,940 INFO L226 Difference]: Without dead ends: 893 [2023-12-21 01:53:13,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2023-12-21 01:53:13,943 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 239 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:13,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 659 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:53:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-12-21 01:53:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 797. [2023-12-21 01:53:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 729 states have (on average 1.2633744855967077) internal successors, (921), 732 states have internal predecessors, (921), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:53:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1029 transitions. [2023-12-21 01:53:14,014 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1029 transitions. Word has length 134 [2023-12-21 01:53:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:14,015 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1029 transitions. [2023-12-21 01:53:14,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:53:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1029 transitions. [2023-12-21 01:53:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 01:53:14,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:14,016 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:53:14,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 01:53:14,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:53:14,222 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:14,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1543955261, now seen corresponding path program 1 times [2023-12-21 01:53:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876900765] [2023-12-21 01:53:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:14,237 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:53:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591425085] [2023-12-21 01:53:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:53:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:53:14,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:53:14,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 01:53:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:14,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-21 01:53:14,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:53:16,012 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2023-12-21 01:53:16,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2023-12-21 01:53:16,155 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 01:53:16,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2023-12-21 01:53:16,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:16,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2023-12-21 01:53:16,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:53:16,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2023-12-21 01:53:16,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-12-21 01:53:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 01:53:16,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:53:21,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset Int) (|ULTIMATE.start_step_#t~mem14#1| Int) (v_ArrVal_702 Int) (|ULTIMATE.start_step_#t~ite13#1| Int) (v_ArrVal_700 Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int#2| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (store (select |c_#memory_int#2| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset (+ |ULTIMATE.start_step_#t~mem14#1| |ULTIMATE.start_step_#t~ite13#1|))))) (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.base (store (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.offset v_ArrVal_700))))) (let ((.cse0 (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (or (< (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store (select |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_702)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 4294967296) (mod .cse0 4294967296)) (= (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) .cse0))))) is different from false [2023-12-21 01:53:21,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:53:21,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 475 treesize of output 434 [2023-12-21 01:53:21,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 231 [2023-12-21 01:53:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:53:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876900765] [2023-12-21 01:53:22,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:53:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591425085] [2023-12-21 01:53:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591425085] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:53:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:53:22,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2023-12-21 01:53:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658143681] [2023-12-21 01:53:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 01:53:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 01:53:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=598, Unknown=1, NotChecked=50, Total=756 [2023-12-21 01:53:22,058 INFO L87 Difference]: Start difference. First operand 797 states and 1029 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:53:26,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 01:53:28,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 01:53:33,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 01:53:50,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 01:53:58,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 01:54:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:01,081 INFO L93 Difference]: Finished difference Result 1796 states and 2316 transitions. [2023-12-21 01:54:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 01:54:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 01:54:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:01,090 INFO L225 Difference]: With dead ends: 1796 [2023-12-21 01:54:01,091 INFO L226 Difference]: Without dead ends: 1074 [2023-12-21 01:54:01,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=367, Invalid=1983, Unknown=6, NotChecked=94, Total=2450 [2023-12-21 01:54:01,093 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 403 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 48 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:01,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 813 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 798 Invalid, 3 Unknown, 253 Unchecked, 17.3s Time] [2023-12-21 01:54:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2023-12-21 01:54:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 797. [2023-12-21 01:54:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 729 states have (on average 1.2633744855967077) internal successors, (921), 732 states have internal predecessors, (921), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:54:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1029 transitions. [2023-12-21 01:54:01,166 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1029 transitions. Word has length 135 [2023-12-21 01:54:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:01,167 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1029 transitions. [2023-12-21 01:54:01,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1029 transitions. [2023-12-21 01:54:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 01:54:01,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:01,168 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:01,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:01,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:01,375 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:01,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -379272773, now seen corresponding path program 1 times [2023-12-21 01:54:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:01,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077688259] [2023-12-21 01:54:01,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:01,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:01,389 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:01,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878371357] [2023-12-21 01:54:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:01,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:01,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 01:54:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:01,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 01:54:01,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:01,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 01:54:02,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 01:54:02,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 01:54:02,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 01:54:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 93 proven. 289 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-21 01:54:02,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:54:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077688259] [2023-12-21 01:54:02,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878371357] [2023-12-21 01:54:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878371357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:54:02,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:54:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-12-21 01:54:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217244818] [2023-12-21 01:54:02,479 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 01:54:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:54:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:02,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:54:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:54:02,481 INFO L87 Difference]: Start difference. First operand 797 states and 1029 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:54:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:03,089 INFO L93 Difference]: Finished difference Result 1385 states and 1778 transitions. [2023-12-21 01:54:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:54:03,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2023-12-21 01:54:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:03,092 INFO L225 Difference]: With dead ends: 1385 [2023-12-21 01:54:03,092 INFO L226 Difference]: Without dead ends: 663 [2023-12-21 01:54:03,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-12-21 01:54:03,093 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 139 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:03,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 320 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:54:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2023-12-21 01:54:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 649. [2023-12-21 01:54:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 578 states have (on average 1.2439446366782008) internal successors, (719), 581 states have internal predecessors, (719), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:54:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 827 transitions. [2023-12-21 01:54:03,173 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 827 transitions. Word has length 135 [2023-12-21 01:54:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:03,174 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 827 transitions. [2023-12-21 01:54:03,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:54:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 827 transitions. [2023-12-21 01:54:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 01:54:03,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:03,175 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:03,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:03,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-21 01:54:03,384 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:03,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1703438152, now seen corresponding path program 1 times [2023-12-21 01:54:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:03,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209100223] [2023-12-21 01:54:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:54:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:54:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:54:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:54:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:54:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:54:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:54:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:54:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:54:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:54:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:54:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:54:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:54:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:54:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:54:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:54:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:54:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:03,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209100223] [2023-12-21 01:54:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209100223] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:03,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:54:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064307297] [2023-12-21 01:54:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:03,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:54:03,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:03,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:54:03,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:54:03,840 INFO L87 Difference]: Start difference. First operand 649 states and 827 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:54:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:04,421 INFO L93 Difference]: Finished difference Result 942 states and 1171 transitions. [2023-12-21 01:54:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:54:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 136 [2023-12-21 01:54:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:04,424 INFO L225 Difference]: With dead ends: 942 [2023-12-21 01:54:04,424 INFO L226 Difference]: Without dead ends: 940 [2023-12-21 01:54:04,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:54:04,425 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 188 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:04,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 706 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:54:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-12-21 01:54:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 937. [2023-12-21 01:54:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 823 states have (on average 1.2053462940461726) internal successors, (992), 830 states have internal predecessors, (992), 86 states have call successors, (86), 27 states have call predecessors, (86), 27 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-21 01:54:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1164 transitions. [2023-12-21 01:54:04,562 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1164 transitions. Word has length 136 [2023-12-21 01:54:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:04,562 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1164 transitions. [2023-12-21 01:54:04,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 01:54:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1164 transitions. [2023-12-21 01:54:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 01:54:04,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:04,564 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:04,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-21 01:54:04,564 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:04,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2068353727, now seen corresponding path program 1 times [2023-12-21 01:54:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84204933] [2023-12-21 01:54:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:04,578 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672035140] [2023-12-21 01:54:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:04,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:04,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:04,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:04,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 01:54:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 01:54:04,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:04,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-21 01:54:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:04,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:54:04,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:04,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84204933] [2023-12-21 01:54:04,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:04,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672035140] [2023-12-21 01:54:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672035140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:04,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:54:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906233665] [2023-12-21 01:54:04,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:04,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:54:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:54:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:54:04,841 INFO L87 Difference]: Start difference. First operand 937 states and 1164 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:05,085 INFO L93 Difference]: Finished difference Result 1835 states and 2278 transitions. [2023-12-21 01:54:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:54:05,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 01:54:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:05,089 INFO L225 Difference]: With dead ends: 1835 [2023-12-21 01:54:05,089 INFO L226 Difference]: Without dead ends: 977 [2023-12-21 01:54:05,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:54:05,091 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 32 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:05,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 516 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:54:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2023-12-21 01:54:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 949. [2023-12-21 01:54:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 835 states have (on average 1.2047904191616767) internal successors, (1006), 842 states have internal predecessors, (1006), 86 states have call successors, (86), 27 states have call predecessors, (86), 27 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-21 01:54:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1178 transitions. [2023-12-21 01:54:05,222 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1178 transitions. Word has length 136 [2023-12-21 01:54:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:05,222 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1178 transitions. [2023-12-21 01:54:05,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1178 transitions. [2023-12-21 01:54:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 01:54:05,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:05,223 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:05,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 01:54:05,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-21 01:54:05,432 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:05,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash -347971290, now seen corresponding path program 1 times [2023-12-21 01:54:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286129505] [2023-12-21 01:54:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:05,446 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279040836] [2023-12-21 01:54:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:05,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:05,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:05,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:05,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 01:54:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 01:54:05,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:05,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:54:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286129505] [2023-12-21 01:54:05,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279040836] [2023-12-21 01:54:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279040836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:54:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045786644] [2023-12-21 01:54:05,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:05,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:54:05,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:54:05,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:54:05,640 INFO L87 Difference]: Start difference. First operand 949 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:05,862 INFO L93 Difference]: Finished difference Result 1751 states and 2170 transitions. [2023-12-21 01:54:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:54:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-12-21 01:54:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:05,864 INFO L225 Difference]: With dead ends: 1751 [2023-12-21 01:54:05,864 INFO L226 Difference]: Without dead ends: 765 [2023-12-21 01:54:05,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:54:05,866 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 60 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:05,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 491 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:54:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-12-21 01:54:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 713. [2023-12-21 01:54:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 617 states have (on average 1.1669367909238249) internal successors, (720), 622 states have internal predecessors, (720), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 01:54:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 864 transitions. [2023-12-21 01:54:05,974 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 864 transitions. Word has length 137 [2023-12-21 01:54:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:05,974 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 864 transitions. [2023-12-21 01:54:05,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 864 transitions. [2023-12-21 01:54:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 01:54:05,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:05,976 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:05,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:06,183 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:06,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash 745483622, now seen corresponding path program 1 times [2023-12-21 01:54:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:06,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058195487] [2023-12-21 01:54:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:06,200 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817328114] [2023-12-21 01:54:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:06,202 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:06,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 01:54:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 01:54:06,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:06,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-21 01:54:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:06,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:54:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058195487] [2023-12-21 01:54:06,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817328114] [2023-12-21 01:54:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817328114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:54:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569110405] [2023-12-21 01:54:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:06,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:54:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:06,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:54:06,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:54:06,450 INFO L87 Difference]: Start difference. First operand 713 states and 864 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:06,647 INFO L93 Difference]: Finished difference Result 1358 states and 1641 transitions. [2023-12-21 01:54:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:54:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-12-21 01:54:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:06,650 INFO L225 Difference]: With dead ends: 1358 [2023-12-21 01:54:06,650 INFO L226 Difference]: Without dead ends: 719 [2023-12-21 01:54:06,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:54:06,651 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 30 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:06,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 511 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:54:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-12-21 01:54:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 701. [2023-12-21 01:54:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 605 states have (on average 1.1636363636363636) internal successors, (704), 610 states have internal predecessors, (704), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 01:54:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 848 transitions. [2023-12-21 01:54:06,769 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 848 transitions. Word has length 137 [2023-12-21 01:54:06,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:06,769 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 848 transitions. [2023-12-21 01:54:06,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 848 transitions. [2023-12-21 01:54:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 01:54:06,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:06,770 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:06,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:06,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:06,980 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:06,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2010411356, now seen corresponding path program 1 times [2023-12-21 01:54:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:06,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389134192] [2023-12-21 01:54:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:54:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:54:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:54:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:54:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:54:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:54:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:54:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:54:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:54:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:54:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:54:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:54:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:54:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:54:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:54:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:54:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:54:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389134192] [2023-12-21 01:54:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389134192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:54:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053946777] [2023-12-21 01:54:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:07,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:54:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:07,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:54:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:54:07,347 INFO L87 Difference]: Start difference. First operand 701 states and 848 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:08,052 INFO L93 Difference]: Finished difference Result 1551 states and 1882 transitions. [2023-12-21 01:54:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:54:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-21 01:54:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:08,055 INFO L225 Difference]: With dead ends: 1551 [2023-12-21 01:54:08,056 INFO L226 Difference]: Without dead ends: 924 [2023-12-21 01:54:08,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:54:08,057 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 215 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:08,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 393 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:54:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-12-21 01:54:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 692. [2023-12-21 01:54:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 596 states have (on average 1.157718120805369) internal successors, (690), 601 states have internal predecessors, (690), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 01:54:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 834 transitions. [2023-12-21 01:54:08,168 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 834 transitions. Word has length 138 [2023-12-21 01:54:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:08,169 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 834 transitions. [2023-12-21 01:54:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 834 transitions. [2023-12-21 01:54:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 01:54:08,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:08,170 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:08,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-21 01:54:08,171 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:08,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 826294347, now seen corresponding path program 1 times [2023-12-21 01:54:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032790747] [2023-12-21 01:54:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:08,184 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345067997] [2023-12-21 01:54:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:08,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:08,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:08,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:08,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 01:54:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 01:54:08,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:08,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 01:54:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:08,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:54:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032790747] [2023-12-21 01:54:08,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345067997] [2023-12-21 01:54:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345067997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:54:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199177150] [2023-12-21 01:54:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:08,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:54:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:54:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:54:08,407 INFO L87 Difference]: Start difference. First operand 692 states and 834 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:08,596 INFO L93 Difference]: Finished difference Result 1342 states and 1616 transitions. [2023-12-21 01:54:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:54:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-21 01:54:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:08,599 INFO L225 Difference]: With dead ends: 1342 [2023-12-21 01:54:08,599 INFO L226 Difference]: Without dead ends: 705 [2023-12-21 01:54:08,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:54:08,601 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 38 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:08,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 509 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:54:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-12-21 01:54:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 631. [2023-12-21 01:54:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 535 states have (on average 1.1476635514018692) internal successors, (614), 540 states have internal predecessors, (614), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 01:54:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 758 transitions. [2023-12-21 01:54:08,712 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 758 transitions. Word has length 138 [2023-12-21 01:54:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:08,713 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 758 transitions. [2023-12-21 01:54:08,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 758 transitions. [2023-12-21 01:54:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 01:54:08,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:08,714 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:08,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:08,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:08,919 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:08,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash 336233147, now seen corresponding path program 1 times [2023-12-21 01:54:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485200705] [2023-12-21 01:54:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:08,947 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:08,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030108097] [2023-12-21 01:54:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:08,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:08,948 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:08,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 01:54:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:09,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 01:54:09,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:09,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 01:54:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:09,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:54:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485200705] [2023-12-21 01:54:09,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030108097] [2023-12-21 01:54:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030108097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:09,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:09,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:54:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358317078] [2023-12-21 01:54:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:09,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:54:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:09,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:54:09,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:54:09,167 INFO L87 Difference]: Start difference. First operand 631 states and 758 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:09,338 INFO L93 Difference]: Finished difference Result 1170 states and 1396 transitions. [2023-12-21 01:54:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:54:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2023-12-21 01:54:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:09,340 INFO L225 Difference]: With dead ends: 1170 [2023-12-21 01:54:09,340 INFO L226 Difference]: Without dead ends: 607 [2023-12-21 01:54:09,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:54:09,342 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 16 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:09,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 416 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:54:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-21 01:54:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2023-12-21 01:54:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 511 states have (on average 1.1232876712328768) internal successors, (574), 516 states have internal predecessors, (574), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 01:54:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 718 transitions. [2023-12-21 01:54:09,446 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 718 transitions. Word has length 139 [2023-12-21 01:54:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:09,446 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 718 transitions. [2023-12-21 01:54:09,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 718 transitions. [2023-12-21 01:54:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 01:54:09,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:09,448 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:09,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:09,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-21 01:54:09,669 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:09,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -301435502, now seen corresponding path program 1 times [2023-12-21 01:54:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:09,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080530749] [2023-12-21 01:54:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:09,683 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915718122] [2023-12-21 01:54:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:09,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:09,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 01:54:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:09,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 01:54:09,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:10,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-12-21 01:54:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2023-12-21 01:54:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 01:54:11,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:54:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2023-12-21 01:54:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:54:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080530749] [2023-12-21 01:54:11,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:54:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915718122] [2023-12-21 01:54:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915718122] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:54:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:54:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-12-21 01:54:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53087056] [2023-12-21 01:54:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:11,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:54:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:11,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:54:11,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:54:11,473 INFO L87 Difference]: Start difference. First operand 607 states and 718 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:12,085 INFO L93 Difference]: Finished difference Result 764 states and 896 transitions. [2023-12-21 01:54:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:54:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2023-12-21 01:54:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:12,088 INFO L225 Difference]: With dead ends: 764 [2023-12-21 01:54:12,088 INFO L226 Difference]: Without dead ends: 762 [2023-12-21 01:54:12,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-12-21 01:54:12,088 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 137 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:12,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 862 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:54:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-12-21 01:54:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 759. [2023-12-21 01:54:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 638 states have (on average 1.1144200626959249) internal successors, (711), 645 states have internal predecessors, (711), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 83 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-21 01:54:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 891 transitions. [2023-12-21 01:54:12,234 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 891 transitions. Word has length 139 [2023-12-21 01:54:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:12,234 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 891 transitions. [2023-12-21 01:54:12,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:54:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 891 transitions. [2023-12-21 01:54:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 01:54:12,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:12,235 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:54:12,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 01:54:12,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-21 01:54:12,444 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:12,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -244177200, now seen corresponding path program 1 times [2023-12-21 01:54:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711763533] [2023-12-21 01:54:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:12,457 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:54:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140400588] [2023-12-21 01:54:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:12,459 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:54:12,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 01:54:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:12,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-21 01:54:12,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:12,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 01:54:15,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 01:54:16,462 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2023-12-21 01:54:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2023-12-21 01:54:16,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 01:54:16,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:16,635 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 01:54:16,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-21 01:54:17,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:17,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2023-12-21 01:54:19,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-12-21 01:54:19,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2023-12-21 01:54:20,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:20,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:20,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:54:20,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 39 [2023-12-21 01:54:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 2 proven. 174 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-21 01:54:21,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:54:28,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:54:28,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 359 [2023-12-21 01:57:45,902 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (select (select |c_#memory_int#3| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset) 256))) (let ((.cse40 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.offset)) (.cse3 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.base c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse8 (select |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base)) (.cse7 (mod (div (* (mod (select (select |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (let ((.cse455 (forall ((v_ArrVal_1144 Int)) (= (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296) .cse7))) (.cse453 (not .cse3)) (.cse454 (not .cse40))) (let ((.cse2 (and .cse3 .cse40)) (.cse229 (or .cse455 .cse453 .cse454)) (.cse65 (forall ((v_ArrVal_1144 Int)) (< .cse7 (+ 2147483649 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))))) (.cse163 (< 4294967294 .cse7)) (.cse35 (forall ((v_ArrVal_1144 Int)) (< (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296) (+ 2147483650 .cse7)))) (.cse10 (< .cse7 1))) (let ((.cse447 (= .cse7 0)) (.cse452 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.base c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base)) (.cse458 (and .cse35 (or .cse10 (forall ((v_ArrVal_1144 Int)) (let ((.cse463 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< .cse463 2147483649) (= .cse463 .cse7))))))) (.cse459 (and .cse65 (or (forall ((v_ArrVal_1144 Int)) (let ((.cse462 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< 2147483647 .cse462) (= .cse462 .cse7)))) .cse163))) (.cse456 (and (or .cse2 (let ((.cse460 (forall ((v_ArrVal_1144 Int)) (let ((.cse461 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< 4294967294 .cse461) (= .cse461 .cse7)))))) (and .cse455 (or .cse460 .cse40) (or .cse3 .cse460)))) .cse229)) (.cse451 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.offset))) (let ((.cse1 (or .cse456 .cse451)) (.cse34 (or .cse459 .cse40)) (.cse51 (or .cse458 .cse40)) (.cse185 (or .cse3 .cse459)) (.cse186 (or .cse3 .cse458)) (.cse43 (+ 4294967296 .cse7)) (.cse39 (forall ((v_ArrVal_1144 Int)) (let ((.cse457 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< (+ .cse457 2147483646) .cse7) (< (* 2 .cse457) (+ .cse7 1)) (= .cse457 .cse7))))) (.cse231 (or .cse452 .cse456)) (.cse0 (and .cse452 .cse451)) (.cse232 (not .cse451)) (.cse230 (and .cse3 .cse447 .cse40)) (.cse233 (not .cse452)) (.cse448 (forall ((v_ArrVal_1144 Int)) (not (= (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296) 0))))) (and (or (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (and (or .cse0 (and .cse1 (or (and (or .cse2 (and (or .cse3 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse5 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_194 Int) (v_y_232 Int)) (let ((.cse4 (* v_y_232 2147483648)) (.cse6 (* v_y_194 4294967296))) (or (< (+ .cse4 2147483646) .cse5) (< 4294967294 (+ .cse6 .cse5)) (< (+ .cse6 .cse5 2147483646) (+ .cse4 .cse7)) (< (+ 4294967295 .cse6 .cse5) (* v_y_232 4294967296))))) (< 4294967294 .cse5) (= .cse5 .cse7)))) (or .cse10 (forall ((v_y_194 Int) (v_ArrVal_1144 Int) (v_y_232 Int)) (let ((.cse11 (* v_y_232 2147483648)) (.cse14 (* v_y_194 4294967296)) (.cse13 (* v_y_232 4294967296)) (.cse12 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< (+ .cse11 2147483646) .cse12) (< (+ .cse13 .cse7) (+ 2 .cse14 (* 2 .cse12))) (< 4294967294 (+ .cse14 .cse12)) (< (+ 2147483647 .cse14 .cse12) .cse11) (< (+ 4294967295 .cse14 .cse12) .cse13) (= .cse12 .cse7))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse18 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_236 Int)) (or (< v_z_236 0) (< 4294967295 v_z_236) (forall ((v_y_236 Int)) (let ((.cse23 (* 4294967295 v_z_236)) (.cse24 (* v_y_236 4294967296))) (let ((.cse15 (+ .cse23 .cse24))) (or (< .cse15 0) (< 2147483647 .cse15) (forall ((v_z_242 Int) (v_y_194 Int) (v_y_242 Int)) (let ((.cse22 (* v_y_194 4294967296)) (.cse20 (* v_y_242 4294967296)) (.cse21 (* v_z_242 2147483648))) (let ((.cse17 (+ .cse20 .cse23 .cse21 .cse24)) (.cse19 (+ .cse23 .cse24 .cse22 .cse18)) (.cse16 (+ .cse21 v_z_236))) (or (< 4294967295 .cse16) (< .cse17 (+ .cse18 1)) (< v_z_242 0) (< 4294967295 .cse17) (= .cse19 (+ .cse20 .cse21 .cse7)) (< .cse17 (+ .cse22 .cse18 1)) (< .cse19 (+ .cse20 .cse21)) (= .cse16 .cse7))))))))))) (= .cse18 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse33 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_318 Int)) (or (forall ((v_y_318 Int)) (let ((.cse30 (* v_y_318 4294967296)) (.cse31 (* 4294967295 v_z_318))) (let ((.cse25 (+ .cse30 .cse31))) (or (< 2147483647 .cse25) (forall ((v_y_194 Int) (v_z_320 Int) (v_y_320 Int)) (let ((.cse32 (* v_y_194 4294967296)) (.cse27 (* v_z_320 2147483648)) (.cse29 (* v_y_320 4294967296))) (let ((.cse26 (+ .cse30 .cse27 .cse29 .cse31)) (.cse28 (+ .cse30 .cse32 .cse33 .cse31))) (or (< .cse26 0) (= (+ v_z_318 .cse27) .cse7) (< v_z_320 0) (= .cse28 (+ .cse27 .cse29 4294967296 .cse7)) (< (+ .cse30 4294967295 .cse27 .cse29 .cse31) (+ .cse32 .cse33)) (< .cse33 .cse26) (< 1 v_z_320) (< .cse28 (+ .cse27 .cse29 4294967296)))))) (< .cse25 0))))) (< v_z_318 0) (< 4294967295 v_z_318))) (= .cse33 .cse7)))) .cse34 (or (and .cse35 (forall ((v_ArrVal_1144 Int)) (let ((.cse36 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_279 Int) (v_y_189 Int)) (let ((.cse37 (* v_y_279 2147483648)) (.cse38 (* v_y_189 4294967296))) (or (< .cse36 .cse37) (< v_y_279 0) (< (+ .cse37 .cse7) (+ .cse38 .cse36 1)) (< (+ .cse38 .cse36) 0)))) (= .cse36 .cse7)))) .cse39) .cse40) (forall ((v_ArrVal_1144 Int)) (let ((.cse45 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_299 Int)) (or (forall ((v_y_299 Int)) (let ((.cse47 (* 4294967295 v_z_299)) (.cse48 (* v_y_299 4294967296))) (let ((.cse41 (+ .cse47 .cse48))) (or (< 2147483647 .cse41) (forall ((v_y_191 Int) (v_z_302 Int) (v_y_302 Int)) (let ((.cse49 (* v_y_302 4294967296)) (.cse50 (* v_z_302 2147483648))) (let ((.cse44 (+ v_z_299 .cse50)) (.cse42 (+ .cse49 .cse50 .cse47 .cse48)) (.cse46 (* v_y_191 4294967296))) (or (< 4294967295 .cse42) (= .cse43 .cse44) (< .cse42 (+ .cse45 1)) (= (+ .cse46 .cse47 4294967296 .cse45 .cse48) (+ .cse49 .cse50 .cse7)) (= .cse44 .cse7) (< 1 v_z_302) (< (+ .cse46 4294967296 .cse45) .cse42) (< v_z_302 0) (< (+ .cse49 .cse50) (+ .cse46 .cse47 .cse45 .cse48 1)))))) (< .cse41 0))))) (< v_z_299 0) (< 4294967295 v_z_299))) (= .cse45 .cse7)))) .cse51 (forall ((v_ArrVal_1144 Int)) (let ((.cse54 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_211 Int)) (or (forall ((v_y_211 Int)) (let ((.cse57 (* 4294967295 v_z_211)) (.cse58 (* v_y_211 4294967296))) (let ((.cse52 (+ .cse57 .cse58))) (or (< .cse52 0) (forall ((v_z_214 Int) (v_y_214 Int) (v_y_189 Int)) (let ((.cse60 (* v_y_214 4294967296)) (.cse61 (* v_z_214 2147483648))) (let ((.cse55 (+ .cse57 .cse58 .cse60 .cse61)) (.cse56 (+ v_z_211 .cse61)) (.cse59 (+ .cse60 .cse61 .cse7)) (.cse53 (* v_y_189 4294967296))) (or (< (+ .cse53 4294967296 .cse54) .cse55) (< .cse55 (+ .cse54 1)) (< 1 v_z_214) (< v_z_214 0) (< 4294967295 .cse55) (= .cse56 .cse7) (< .cse55 (+ .cse53 .cse54 1)) (= (+ .cse53 .cse57 .cse58 4294967296 .cse54) .cse59) (= .cse56 .cse43) (= .cse59 (+ .cse53 .cse57 .cse58 .cse54)))))) (< 2147483647 .cse52))))) (< v_z_211 0) (< 4294967295 v_z_211))) (= .cse54 .cse7)))) (or .cse3 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse63 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_217 Int) (v_y_189 Int)) (let ((.cse64 (+ (* v_y_217 4294967296) .cse7)) (.cse62 (* v_y_189 4294967296))) (or (< (+ .cse62 8589934590 .cse63) .cse64) (< 4294967294 (+ .cse62 .cse63)) (< v_y_189 0) (< 1 v_y_217) (< .cse64 (+ .cse62 2 (* 2 .cse63)))))) (< 4294967294 .cse63) (= .cse63 .cse7)))) .cse65 (forall ((v_ArrVal_1144 Int)) (let ((.cse67 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_217 Int) (v_y_189 Int)) (let ((.cse68 (* v_y_217 2147483648)) (.cse66 (* v_y_189 4294967296))) (or (< (+ .cse66 .cse67 2147483646) (+ .cse68 .cse7)) (< (+ .cse68 2147483646) (+ .cse66 .cse67)) (< v_y_189 0) (< 1 v_y_217)))) (< 4294967294 .cse67) (= .cse67 .cse7)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse72 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_236 Int)) (or (< v_z_236 0) (< 4294967295 v_z_236) (forall ((v_y_236 Int)) (let ((.cse77 (* 4294967295 v_z_236)) (.cse78 (* v_y_236 4294967296))) (let ((.cse69 (+ .cse77 .cse78))) (or (< .cse69 0) (< 2147483647 .cse69) (forall ((v_z_241 Int) (v_y_194 Int) (v_y_241 Int)) (let ((.cse73 (* v_y_194 4294967296)) (.cse75 (* v_y_241 4294967296)) (.cse74 (* v_z_241 2147483648))) (let ((.cse70 (+ .cse74 v_z_236)) (.cse71 (+ .cse74 .cse77 .cse75 .cse78)) (.cse76 (+ .cse77 .cse78 .cse73 .cse72))) (or (= .cse70 .cse43) (< .cse71 (+ .cse72 1)) (< .cse71 (+ .cse73 .cse72 1)) (< .cse70 4294967296) (< 4294967295 .cse71) (= (+ .cse74 .cse75 .cse7) .cse76) (< .cse76 (+ .cse74 .cse75)) (< 1 v_z_241))))))))))) (= .cse72 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse79 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (= .cse79 .cse7) (forall ((v_z_283 Int)) (or (forall ((v_y_283 Int)) (let ((.cse86 (* v_y_283 4294967296)) (.cse87 (* 4294967295 v_z_283))) (let ((.cse80 (+ .cse86 .cse87))) (or (< .cse80 0) (< 2147483647 .cse80) (forall ((v_z_284 Int) (v_y_284 Int) (v_y_189 Int)) (let ((.cse83 (* v_y_284 4294967296)) (.cse84 (* v_z_284 2147483648)) (.cse89 (* v_y_189 4294967296))) (let ((.cse85 (+ .cse89 .cse86 .cse79 .cse87)) (.cse82 (+ v_z_283 .cse84)) (.cse88 (+ .cse89 .cse79)) (.cse81 (+ .cse83 .cse86 .cse84 .cse87))) (or (< .cse81 0) (< 4294967295 .cse82) (= (+ .cse83 .cse84 .cse7) .cse85) (= (+ .cse83 .cse84 4294967296 .cse7) .cse85) (= .cse82 .cse7) (< (+ .cse83 .cse86 4294967295 .cse84 .cse87) .cse88) (< .cse88 .cse81) (< v_z_284 0) (< .cse79 .cse81))))))))) (< v_z_283 0) (< 4294967295 v_z_283)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse92 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_211 Int)) (or (< v_z_211 0) (< 4294967295 v_z_211) (forall ((v_y_211 Int)) (let ((.cse95 (* 4294967295 v_z_211)) (.cse96 (* v_y_211 4294967296))) (let ((.cse90 (+ .cse95 .cse96))) (or (< .cse90 0) (forall ((v_z_214 Int) (v_y_214 Int) (v_y_189 Int)) (let ((.cse98 (* v_y_214 4294967296)) (.cse99 (* v_z_214 2147483648))) (let ((.cse94 (+ v_z_211 .cse99)) (.cse93 (+ .cse95 .cse96 .cse98 .cse99)) (.cse97 (+ .cse98 .cse99 .cse7)) (.cse91 (* v_y_189 4294967296))) (or (< (+ .cse91 4294967296 .cse92) .cse93) (< .cse93 (+ .cse92 1)) (< 4294967295 .cse94) (< v_z_214 0) (< 4294967295 .cse93) (= .cse94 .cse7) (< .cse93 (+ .cse91 .cse92 1)) (= (+ .cse91 .cse95 .cse96 4294967296 .cse92) .cse97) (= .cse97 (+ .cse91 .cse95 .cse96 .cse92)))))) (< 2147483647 .cse90))))))) (= .cse92 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse102 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_299 Int)) (or (forall ((v_y_299 Int)) (let ((.cse104 (* 4294967295 v_z_299)) (.cse105 (* v_y_299 4294967296))) (let ((.cse108 (+ .cse104 .cse105))) (or (forall ((v_y_191 Int) (v_z_302 Int) (v_y_302 Int)) (let ((.cse106 (* v_y_302 4294967296)) (.cse107 (* v_z_302 2147483648))) (let ((.cse100 (+ .cse106 .cse107 .cse104 .cse105)) (.cse101 (+ v_z_299 .cse107)) (.cse103 (* v_y_191 4294967296))) (or (< 4294967295 .cse100) (= .cse43 .cse101) (< .cse100 (+ .cse102 1)) (= (+ .cse103 .cse104 4294967296 .cse102 .cse105) (+ .cse106 .cse107 .cse7)) (< 1 v_z_302) (< (+ .cse103 4294967296 .cse102) .cse100) (< .cse101 4294967296) (< (+ .cse106 .cse107) (+ .cse103 .cse104 .cse102 .cse105 1)))))) (< 2147483647 .cse108) (< .cse108 0))))) (< v_z_299 0) (< 4294967295 v_z_299))) (= .cse102 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse117 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_283 Int)) (or (< v_z_283 0) (forall ((v_y_283 Int)) (let ((.cse111 (* v_y_283 4294967296)) (.cse113 (* 4294967295 v_z_283))) (let ((.cse109 (+ .cse111 .cse113))) (or (< .cse109 0) (< 2147483647 .cse109) (forall ((v_z_289 Int) (v_y_289 Int) (v_y_189 Int)) (let ((.cse112 (* v_y_289 4294967296)) (.cse110 (* v_z_289 2147483648)) (.cse118 (* v_y_189 4294967296))) (let ((.cse114 (+ .cse118 .cse117)) (.cse115 (+ .cse110 v_z_283)) (.cse116 (+ .cse110 .cse111 .cse112 .cse113))) (or (< (+ .cse110 .cse111 4294967295 .cse112 .cse113) .cse114) (< .cse115 4294967296) (< .cse116 0) (< 1 v_z_289) (< .cse114 .cse116) (= .cse115 .cse43) (< .cse117 .cse116) (= (+ .cse110 .cse112 .cse7) (+ .cse118 .cse111 .cse117 .cse113)))))))))) (< 4294967295 v_z_283))) (= .cse117 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse128 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_283 Int)) (or (< v_z_283 0) (forall ((v_y_283 Int)) (let ((.cse126 (* v_y_283 4294967296)) (.cse127 (* 4294967295 v_z_283))) (let ((.cse119 (+ .cse126 .cse127))) (or (< .cse119 0) (< 2147483647 .cse119) (forall ((v_z_288 Int) (v_y_189 Int) (v_y_288 Int)) (let ((.cse121 (* v_y_288 4294967296)) (.cse122 (* v_z_288 2147483648)) (.cse129 (* v_y_189 4294967296))) (let ((.cse123 (+ .cse129 .cse126 .cse128 .cse127)) (.cse120 (+ .cse122 v_z_283)) (.cse125 (+ .cse129 .cse128)) (.cse124 (+ .cse121 .cse126 .cse122 .cse127))) (or (= .cse43 .cse120) (= (+ .cse121 .cse122 .cse7) .cse123) (< .cse124 0) (= (+ .cse121 .cse122 4294967296 .cse7) .cse123) (< .cse125 .cse124) (= .cse120 .cse7) (< v_z_288 0) (< (+ .cse121 .cse126 4294967295 .cse122 .cse127) .cse125) (< 1 v_z_288) (< .cse128 .cse124))))))))) (< 4294967295 v_z_283))) (= .cse128 .cse7)))) (or .cse40 (and .cse65 (forall ((v_ArrVal_1144 Int)) (let ((.cse131 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_215 Int) (v_y_189 Int)) (let ((.cse130 (* v_y_189 4294967296))) (or (< (+ (* v_y_215 4294967296) .cse7) (+ .cse130 2 (* 2 .cse131))) (< 1 v_y_215) (< 4294967294 (+ .cse130 .cse131)) (< v_y_189 0) (< (+ .cse130 6442450942 .cse131) (+ (* v_y_215 2147483648) .cse7))))) (< 4294967294 .cse131) (= .cse131 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse133 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_215 Int) (v_y_189 Int)) (let ((.cse134 (* v_y_215 2147483648)) (.cse132 (* v_y_189 4294967296))) (or (< (+ .cse132 .cse133 2147483646) (+ .cse134 .cse7)) (< (+ .cse134 2147483646) .cse133) (< 1 v_y_215) (< 4294967294 (+ .cse132 .cse133))))) (< 4294967294 .cse133) (= .cse133 .cse7)))))) (or (and .cse35 .cse39 (forall ((v_ArrVal_1144 Int)) (let ((.cse139 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_189 Int) (v_y_277 Int)) (let ((.cse138 (* v_y_189 4294967296))) (let ((.cse135 (* v_y_277 2147483648)) (.cse136 (+ .cse138 .cse139 1)) (.cse137 (+ .cse138 .cse139))) (or (< (+ .cse135 .cse7) .cse136) (< .cse137 .cse135) (< (+ (* v_y_277 4294967296) .cse7) .cse136) (< 0 v_y_189) (< .cse137 0))))) (= .cse139 .cse7))))) .cse3) (forall ((v_ArrVal_1144 Int)) (let ((.cse147 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_259 Int)) (or (forall ((v_y_259 Int)) (let ((.cse148 (* 4294967295 v_z_259)) (.cse149 (* v_y_259 4294967296))) (let ((.cse140 (+ .cse148 .cse149))) (or (< .cse140 0) (< 2147483647 .cse140) (forall ((v_z_262 Int) (v_y_262 Int) (v_y_191 Int)) (let ((.cse141 (* v_y_262 4294967296)) (.cse142 (* v_z_262 2147483648)) (.cse146 (* v_y_191 4294967296))) (let ((.cse143 (+ .cse146 .cse148 .cse149 .cse147)) (.cse145 (+ v_z_259 .cse142)) (.cse144 (+ .cse141 .cse148 .cse149 .cse142))) (or (< (+ .cse141 4294967295 .cse142) .cse143) (= .cse143 (+ .cse141 .cse142 .cse7)) (< .cse144 0) (< .cse145 4294967296) (< (+ .cse146 .cse147) .cse144) (< 1 v_z_262) (= .cse43 .cse145) (< .cse147 .cse144))))))))) (< 4294967295 v_z_259) (< v_z_259 0))) (= .cse147 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse153 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_211 Int)) (or (forall ((v_y_211 Int)) (let ((.cse156 (* 4294967295 v_z_211)) (.cse157 (* v_y_211 4294967296))) (let ((.cse150 (+ .cse156 .cse157))) (or (< .cse150 0) (forall ((v_z_213 Int) (v_y_213 Int) (v_y_189 Int)) (let ((.cse158 (* v_z_213 2147483648)) (.cse159 (* v_y_213 4294967296))) (let ((.cse154 (+ .cse158 .cse159 .cse7)) (.cse151 (+ .cse158 v_z_211)) (.cse155 (* v_y_189 4294967296)) (.cse152 (+ .cse158 .cse156 .cse157 .cse159))) (or (= .cse43 .cse151) (< .cse152 (+ .cse153 1)) (= .cse154 (+ .cse155 .cse156 .cse157 4294967296 .cse153)) (< 4294967295 .cse152) (< 1 v_z_213) (= .cse154 (+ .cse155 .cse156 .cse157 .cse153)) (< .cse152 (+ .cse155 .cse153 1)) (< .cse151 4294967296) (< (+ .cse155 4294967296 .cse153) .cse152))))) (< 2147483647 .cse150))))) (< v_z_211 0) (< 4294967295 v_z_211))) (= .cse153 .cse7)))) (or .cse40 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse161 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_191 Int) (v_y_254 Int)) (let ((.cse160 (* v_y_191 4294967296)) (.cse162 (* v_y_254 2147483648))) (or (< v_y_254 0) (< (+ .cse160 .cse161) .cse162) (< (+ .cse162 .cse7) (+ .cse160 .cse161 1)) (< .cse161 .cse162)))) (= .cse161 .cse7)))) (or .cse163 (forall ((v_y_191 Int) (v_ArrVal_1144 Int) (v_y_254 Int)) (let ((.cse165 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296)) (.cse164 (* v_y_254 2147483648))) (or (< v_y_254 0) (< (+ 4294967295 .cse164) (+ (* v_y_191 4294967296) .cse165)) (< (+ (* 2 .cse165) (* 8589934592 v_y_191)) (+ (* v_y_254 4294967296) .cse7 1)) (= .cse165 .cse7) (< .cse165 .cse164))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse172 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_259 Int)) (or (forall ((v_y_259 Int)) (let ((.cse174 (* 4294967295 v_z_259)) (.cse175 (* v_y_259 4294967296))) (let ((.cse166 (+ .cse174 .cse175))) (or (< .cse166 0) (< 2147483647 .cse166) (forall ((v_y_260 Int) (v_y_191 Int) (v_z_260 Int)) (let ((.cse171 (* v_y_191 4294967296)) (.cse168 (* v_y_260 4294967296)) (.cse167 (* v_z_260 2147483648))) (let ((.cse170 (+ .cse167 v_z_259)) (.cse173 (+ .cse167 .cse168 .cse174 .cse175)) (.cse169 (+ .cse171 .cse174 .cse175 .cse172))) (or (< (+ .cse167 4294967295 .cse168) .cse169) (< 4294967295 .cse170) (< (+ .cse171 .cse172) .cse173) (< .cse172 .cse173) (= .cse170 .cse7) (< .cse173 0) (= .cse169 (+ .cse167 .cse168 .cse7)) (< v_z_260 0))))))))) (< 4294967295 v_z_259) (< v_z_259 0))) (= .cse172 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse178 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_299 Int)) (or (forall ((v_y_299 Int)) (let ((.cse181 (* 4294967295 v_z_299)) (.cse182 (* v_y_299 4294967296))) (let ((.cse176 (+ .cse181 .cse182))) (or (< 2147483647 .cse176) (forall ((v_y_191 Int) (v_z_301 Int) (v_y_301 Int)) (let ((.cse184 (* v_y_301 4294967296)) (.cse183 (* v_z_301 2147483648))) (let ((.cse179 (+ v_z_299 .cse183)) (.cse180 (* v_y_191 4294967296)) (.cse177 (+ .cse183 .cse181 .cse184 .cse182))) (or (< .cse177 (+ .cse178 1)) (= .cse179 .cse7) (= (+ .cse180 .cse181 4294967296 .cse178 .cse182) (+ .cse183 .cse184 .cse7)) (< v_z_301 0) (< 4294967295 .cse179) (< 4294967295 .cse177) (< (+ .cse183 .cse184) (+ .cse180 .cse181 .cse178 .cse182 1)) (< (+ .cse180 4294967296 .cse178) .cse177))))) (< .cse176 0))))) (< v_z_299 0) (< 4294967295 v_z_299))) (= .cse178 .cse7)))) .cse185 .cse186 (forall ((v_ArrVal_1144 Int)) (let ((.cse189 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_318 Int)) (or (forall ((v_y_318 Int)) (let ((.cse193 (* v_y_318 4294967296)) (.cse194 (* 4294967295 v_z_318))) (let ((.cse187 (+ .cse193 .cse194))) (or (< 2147483647 .cse187) (forall ((v_y_319 Int) (v_y_194 Int) (v_z_319 Int)) (let ((.cse195 (* v_y_194 4294967296)) (.cse191 (* v_z_319 2147483648)) (.cse192 (* v_y_319 4294967296))) (let ((.cse188 (+ .cse191 .cse193 .cse192 .cse194)) (.cse190 (+ .cse193 .cse195 .cse189 .cse194))) (or (< .cse188 0) (< 1 v_z_319) (< .cse189 .cse188) (< .cse190 (+ .cse191 .cse192 4294967296)) (< v_z_319 0) (< (+ .cse191 .cse193 4294967295 .cse192 .cse194) (+ .cse195 .cse189)) (= (+ .cse191 v_z_318) .cse7) (= .cse190 (+ .cse191 .cse192 4294967296 .cse7)))))) (< .cse187 0))))) (< v_z_318 0) (< 4294967295 v_z_318))) (= .cse189 .cse7)))) (or (and (forall ((v_ArrVal_1144 Int)) (let ((.cse197 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_191 Int) (v_y_264 Int)) (let ((.cse196 (* v_y_191 4294967296)) (.cse198 (* v_y_264 2147483648))) (or (< (+ .cse196 .cse197) .cse198) (< v_y_264 0) (< (+ .cse198 .cse7) (+ .cse196 .cse197 1)) (< .cse197 .cse198)))) (= .cse197 .cse7)))) (or (forall ((v_y_191 Int) (v_ArrVal_1144 Int) (v_y_264 Int)) (let ((.cse202 (* v_y_191 4294967296)) (.cse201 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (let ((.cse200 (* v_y_264 2147483648)) (.cse199 (+ .cse202 .cse201))) (or (< .cse199 .cse200) (< v_y_264 0) (< .cse201 .cse200) (< (+ .cse202 (* 2 .cse201)) (+ (* v_y_264 4294967296) .cse7 1)) (< (+ .cse200 4294967295) .cse199) (= .cse201 .cse7))))) .cse163)) .cse3) (forall ((v_ArrVal_1144 Int)) (let ((.cse208 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_259 Int)) (or (forall ((v_y_259 Int)) (let ((.cse211 (* 4294967295 v_z_259)) (.cse212 (* v_y_259 4294967296))) (let ((.cse203 (+ .cse211 .cse212))) (or (< .cse203 0) (< 2147483647 .cse203) (forall ((v_y_260 Int) (v_y_191 Int) (v_z_260 Int)) (let ((.cse207 (* v_y_191 4294967296)) (.cse204 (* v_z_260 2147483648)) (.cse205 (* v_y_260 4294967296))) (let ((.cse209 (+ .cse204 .cse205 .cse211 .cse212)) (.cse206 (+ .cse207 .cse211 .cse212 .cse208)) (.cse210 (+ .cse204 v_z_259))) (or (< (+ .cse204 4294967295 .cse205) .cse206) (< 1 v_z_260) (< (+ .cse207 .cse208) .cse209) (< .cse208 .cse209) (= .cse210 .cse7) (< .cse209 0) (= .cse206 (+ .cse204 .cse205 .cse7)) (= .cse210 .cse43) (< v_z_260 0))))))))) (< 4294967295 v_z_259) (< v_z_259 0))) (= .cse208 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse213 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (= .cse213 .cse7) (forall ((v_z_236 Int)) (or (< v_z_236 0) (< 4294967295 v_z_236) (forall ((v_y_236 Int)) (let ((.cse220 (* 4294967295 v_z_236)) (.cse221 (* v_y_236 4294967296))) (let ((.cse222 (+ .cse220 .cse221))) (or (forall ((v_y_194 Int) (v_y_238 Int) (v_z_238 Int)) (let ((.cse218 (* v_y_238 4294967296)) (.cse216 (* v_y_194 4294967296)) (.cse219 (* v_z_238 2147483648))) (let ((.cse214 (+ v_z_236 .cse219)) (.cse217 (+ .cse220 .cse221 .cse216 .cse213)) (.cse215 (+ .cse220 .cse221 .cse218 .cse219))) (or (< 1 v_z_238) (= .cse214 .cse43) (< v_z_238 0) (< .cse215 (+ .cse213 1)) (< .cse215 (+ .cse216 .cse213 1)) (= .cse214 .cse7) (< .cse217 (+ .cse218 .cse219)) (= .cse217 (+ .cse218 .cse7 .cse219)) (< 4294967295 .cse215))))) (< .cse222 0) (< 2147483647 .cse222)))))))))) (or (and (forall ((v_ArrVal_1144 Int)) (let ((.cse224 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_194 Int) (v_y_229 Int)) (let ((.cse223 (* v_y_194 4294967296)) (.cse225 (* v_y_229 2147483648))) (or (< 4294967294 (+ .cse223 .cse224)) (< (+ .cse225 2147483646) .cse224) (< (+ .cse223 .cse224 2147483646) (+ .cse225 .cse7)) (< 1 v_y_229)))) (< 4294967294 .cse224) (= .cse224 .cse7)))) (or .cse10 (forall ((v_y_194 Int) (v_y_229 Int) (v_ArrVal_1144 Int)) (let ((.cse228 (* v_y_229 2147483648)) (.cse226 (* v_y_194 4294967296)) (.cse227 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< (+ 2147483647 .cse226 .cse227) .cse228) (< 4294967294 (+ .cse226 .cse227)) (< (+ .cse228 2147483646) .cse227) (< (+ (* v_y_229 4294967296) .cse7) (+ 2 .cse226 (* 2 .cse227))) (= .cse227 .cse7) (< 1 v_y_229)))))) .cse40))) .cse229) .cse230) .cse231)) (or .cse232 .cse233 (and (forall ((v_z_364 Int) (v_ArrVal_1144 Int)) (let ((.cse234 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< (* 2 v_z_364) (+ .cse234 1)) (< 2147483647 v_z_364) (= .cse234 .cse7)))) (forall ((v_z_361 Int) (v_ArrVal_1144 Int)) (let ((.cse235 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< v_z_361 0) (< .cse235 (* 2 v_z_361)) (= .cse235 .cse7)))) (forall ((v_z_364 Int) (v_ArrVal_1144 Int)) (let ((.cse236 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< v_z_364 0) (< .cse236 (* 2 v_z_364)) (= .cse236 .cse7)))) (forall ((v_z_367 Int) (v_ArrVal_1144 Int)) (let ((.cse237 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< 2147483647 v_z_367) (< (* 2 v_z_367) (+ .cse237 1)) (= .cse237 .cse7)))))))) (or (and (or (and .cse1 (or (and (or .cse2 (let ((.cse364 (and (or .cse10 (forall ((v_ArrVal_1144 Int) (v_y_32 Int) (v_y_88 Int)) (let ((.cse439 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296)) (.cse438 (* v_y_88 2147483648))) (or (< (+ .cse438 2147483646) .cse439) (< (+ (* v_y_88 4294967296) .cse7) (+ (* v_y_32 8589934592) 2 (* 2 .cse439))) (= .cse439 .cse7) (< 1 v_y_88) (< (+ 2147483647 (* v_y_32 4294967296) .cse439) .cse438))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse441 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_32 Int) (v_y_88 Int)) (let ((.cse443 (* v_y_88 2147483648))) (let ((.cse440 (+ .cse443 2147483646)) (.cse442 (* v_y_32 4294967296))) (or (< .cse440 .cse441) (< (+ .cse442 .cse441 2147483646) (+ .cse443 .cse7)) (< .cse440 (+ .cse442 .cse441)) (< 1 v_y_88))))) (< 4294967294 .cse441) (= .cse441 .cse7)))))) (.cse382 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse434 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_105 Int) (v_y_32 Int)) (let ((.cse436 (* v_y_32 4294967296))) (let ((.cse435 (* v_y_105 2147483648)) (.cse437 (+ .cse436 .cse434 1))) (or (< .cse434 .cse435) (< (+ .cse436 .cse434) 0) (< (+ .cse7 (* v_y_105 4294967296)) .cse437) (< (+ .cse435 .cse7) .cse437))))) (= .cse434 .cse7)))) .cse35 .cse39))) (and .cse34 (or .cse3 (and (or (forall ((v_ArrVal_1144 Int) (v_y_137 Int) (v_y_32 Int)) (let ((.cse238 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (let ((.cse240 (* v_y_137 2147483648)) (.cse239 (* v_y_137 4294967296)) (.cse241 (+ (* v_y_32 4294967296) .cse238))) (or (< (+ (* v_y_32 8589934592) (* 2 .cse238)) (+ .cse239 .cse7 1)) (< (+ .cse240 4294967295) .cse241) (< .cse241 0) (< .cse238 .cse240) (= .cse238 .cse7) (< (+ .cse239 4294967295) .cse241))))) .cse163) (forall ((v_ArrVal_1144 Int)) (let ((.cse243 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_137 Int) (v_y_32 Int)) (let ((.cse242 (* v_y_32 4294967296))) (let ((.cse244 (* v_y_137 2147483648)) (.cse245 (+ .cse242 .cse243 1))) (or (< (+ .cse242 .cse243) 0) (< .cse243 .cse244) (< (+ .cse244 .cse7) .cse245) (< (+ (* v_y_137 4294967296) .cse7) .cse245))))) (= .cse243 .cse7)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse246 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (= .cse246 .cse7) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse254 (* v_z_90 4294967295)) (.cse255 (* v_y_90 4294967296))) (let ((.cse247 (+ .cse254 .cse255))) (or (< .cse247 0) (< 2147483647 .cse247) (forall ((v_z_91 Int) (v_y_91 Int) (v_y_32 Int)) (let ((.cse252 (* v_y_32 4294967296)) (.cse249 (* v_z_91 2147483648)) (.cse250 (* v_y_91 4294967296))) (let ((.cse248 (+ .cse249 .cse250 .cse254 .cse255)) (.cse253 (+ v_z_90 .cse249)) (.cse251 (+ .cse254 .cse252 .cse255 .cse246))) (or (< .cse248 (+ .cse246 1)) (= (+ .cse249 .cse250 .cse7) .cse251) (< 4294967295 .cse248) (< v_z_91 0) (< .cse248 (+ .cse252 .cse246 1)) (< 4294967295 .cse253) (= .cse253 .cse7) (< .cse251 (+ .cse249 .cse250))))))))))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse256 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_128 Int)) (or (< v_z_128 0) (< 4294967295 v_z_128) (forall ((v_y_128 Int)) (let ((.cse263 (* v_y_128 4294967296)) (.cse264 (* 4294967295 v_z_128))) (let ((.cse265 (+ .cse263 .cse264))) (or (forall ((v_z_130 Int) (v_y_130 Int) (v_y_32 Int)) (let ((.cse262 (* v_y_32 4294967296)) (.cse260 (* v_y_130 4294967296)) (.cse259 (* v_z_130 2147483648))) (let ((.cse258 (+ .cse259 v_z_128)) (.cse257 (+ .cse259 .cse263 .cse264 .cse260)) (.cse261 (+ .cse263 .cse264 .cse262 .cse256))) (or (< .cse256 .cse257) (< .cse257 0) (< v_z_130 0) (< 4294967295 .cse258) (< (+ .cse259 4294967295 .cse260) .cse261) (= .cse258 .cse7) (< (+ .cse262 .cse256) .cse257) (= (+ .cse259 .cse260 .cse7) .cse261))))) (< 2147483647 .cse265) (< .cse265 0))))))) (= .cse256 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse269 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_44 Int)) (or (forall ((v_y_44 Int)) (let ((.cse270 (* v_y_44 4294967296)) (.cse273 (* v_z_44 4294967295))) (let ((.cse266 (+ .cse270 .cse273))) (or (< .cse266 0) (< 2147483647 .cse266) (forall ((v_z_47 Int) (v_y_47 Int) (v_y_32 Int)) (let ((.cse274 (* v_y_32 4294967296)) (.cse271 (* v_z_47 2147483648)) (.cse272 (* v_y_47 4294967296))) (let ((.cse267 (+ .cse270 .cse271 .cse272 .cse273)) (.cse268 (+ .cse271 v_z_44)) (.cse275 (+ .cse270 .cse273 .cse274 .cse269))) (or (< .cse267 0) (= .cse268 .cse7) (< .cse269 .cse267) (< (+ .cse270 .cse271 .cse272 4294967295 .cse273) (+ .cse274 .cse269)) (< .cse275 (+ .cse271 .cse272 4294967296)) (< v_z_47 0) (< 4294967295 .cse268) (= (+ .cse271 .cse272 4294967296 .cse7) .cse275))))))))) (< v_z_44 0) (< 4294967295 v_z_44))) (= .cse269 .cse7)))) .cse51 (forall ((v_ArrVal_1144 Int)) (let ((.cse276 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_128 Int)) (or (forall ((v_y_128 Int)) (let ((.cse283 (* v_y_128 4294967296)) (.cse284 (* 4294967295 v_z_128))) (let ((.cse285 (+ .cse283 .cse284))) (or (forall ((v_z_135 Int) (v_y_135 Int) (v_y_32 Int)) (let ((.cse281 (* v_y_32 4294967296)) (.cse278 (* v_z_135 2147483648)) (.cse279 (* v_y_135 4294967296))) (let ((.cse277 (+ .cse278 .cse283 .cse284 .cse279)) (.cse280 (+ .cse283 .cse284 .cse281 .cse276)) (.cse282 (+ .cse278 v_z_128))) (or (< .cse276 .cse277) (< (+ 4294967295 .cse278 .cse279) .cse280) (< 1 v_z_135) (< .cse277 0) (< (+ .cse281 .cse276) .cse277) (< .cse282 4294967296) (= (+ .cse278 .cse279 .cse7) .cse280) (= .cse43 .cse282))))) (< 2147483647 .cse285) (< .cse285 0))))) (< v_z_128 0) (< 4294967295 v_z_128))) (= .cse276 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse289 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_78 Int)) (or (forall ((v_y_78 Int)) (let ((.cse287 (* v_y_78 4294967296)) (.cse290 (* v_z_78 4294967295))) (let ((.cse286 (+ .cse287 .cse290))) (or (< 2147483647 .cse286) (< .cse286 0) (forall ((v_z_81 Int) (v_y_81 Int) (v_y_32 Int)) (let ((.cse292 (* v_y_81 4294967296)) (.cse291 (* v_z_81 2147483648))) (let ((.cse294 (+ v_z_78 .cse291)) (.cse288 (* v_y_32 4294967296)) (.cse293 (+ .cse291 .cse287 .cse290 .cse292))) (or (= (+ .cse287 .cse288 4294967296 .cse289 .cse290) (+ .cse291 .cse7 .cse292)) (< 4294967295 .cse293) (< .cse294 4294967296) (< (+ .cse288 4294967296 .cse289) .cse293) (= .cse294 .cse43) (< (+ .cse291 .cse292) (+ .cse287 .cse288 .cse289 1 .cse290)) (< .cse293 (+ .cse289 1)) (< 1 v_z_81))))))))) (< 4294967295 v_z_78) (< v_z_78 0))) (= .cse289 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse297 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_66 Int)) (or (< v_z_66 0) (forall ((v_y_66 Int)) (let ((.cse300 (* v_z_66 4294967295)) (.cse301 (* v_y_66 4294967296))) (let ((.cse295 (+ .cse300 .cse301))) (or (< .cse295 0) (forall ((v_y_67 Int) (v_y_32 Int) (v_z_67 Int)) (let ((.cse303 (* v_z_67 2147483648)) (.cse304 (* v_y_67 4294967296))) (let ((.cse298 (+ .cse300 .cse303 .cse304 .cse301)) (.cse302 (+ .cse303 .cse304 .cse7)) (.cse296 (* v_y_32 4294967296)) (.cse299 (+ v_z_66 .cse303))) (or (< (+ .cse296 4294967296 .cse297) .cse298) (< 4294967295 .cse299) (< .cse298 (+ .cse296 .cse297 1)) (= (+ .cse300 .cse301 .cse296 .cse297) .cse302) (< .cse298 (+ .cse297 1)) (< 4294967295 .cse298) (= .cse302 (+ .cse300 .cse301 .cse296 4294967296 .cse297)) (= .cse299 .cse7) (< v_z_67 0))))) (< 2147483647 .cse295))))) (< 4294967295 v_z_66))) (= .cse297 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse307 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse313 (* v_z_90 4294967295)) (.cse314 (* v_y_90 4294967296))) (let ((.cse305 (+ .cse313 .cse314))) (or (< .cse305 0) (forall ((v_z_96 Int) (v_y_96 Int) (v_y_32 Int)) (let ((.cse309 (* v_y_96 4294967296)) (.cse310 (* v_z_96 2147483648)) (.cse311 (* v_y_32 4294967296))) (let ((.cse308 (+ .cse313 .cse311 .cse314 .cse307)) (.cse312 (+ v_z_90 .cse310)) (.cse306 (+ .cse309 .cse313 .cse310 .cse314))) (or (< .cse306 (+ .cse307 1)) (< v_z_96 0) (< .cse308 (+ .cse309 .cse310)) (< .cse306 (+ .cse311 .cse307 1)) (= .cse312 .cse43) (< 1 v_z_96) (= .cse308 (+ .cse309 .cse310 .cse7)) (= .cse312 .cse7) (< 4294967295 .cse306))))) (< 2147483647 .cse305))))))) (= .cse307 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse318 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_78 Int)) (or (< 4294967295 v_z_78) (forall ((v_y_78 Int)) (let ((.cse316 (* v_y_78 4294967296)) (.cse319 (* v_z_78 4294967295))) (let ((.cse315 (+ .cse316 .cse319))) (or (< 2147483647 .cse315) (< .cse315 0) (forall ((v_z_81 Int) (v_y_81 Int) (v_y_32 Int)) (let ((.cse321 (* v_y_81 4294967296)) (.cse320 (* v_z_81 2147483648))) (let ((.cse323 (+ v_z_78 .cse320)) (.cse317 (* v_y_32 4294967296)) (.cse322 (+ .cse320 .cse316 .cse319 .cse321))) (or (= (+ .cse316 .cse317 4294967296 .cse318 .cse319) (+ .cse320 .cse7 .cse321)) (< 4294967295 .cse322) (= .cse323 .cse7) (< (+ .cse317 4294967296 .cse318) .cse322) (< v_z_81 0) (= .cse323 .cse43) (< (+ .cse320 .cse321) (+ .cse316 .cse317 .cse318 1 .cse319)) (< .cse322 (+ .cse318 1)) (< 1 v_z_81))))))))) (< v_z_78 0))) (= .cse318 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse327 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_78 Int)) (or (forall ((v_y_78 Int)) (let ((.cse325 (* v_y_78 4294967296)) (.cse328 (* v_z_78 4294967295))) (let ((.cse324 (+ .cse325 .cse328))) (or (< 2147483647 .cse324) (< .cse324 0) (forall ((v_y_80 Int) (v_z_80 Int) (v_y_32 Int)) (let ((.cse329 (* v_y_80 4294967296)) (.cse330 (* v_z_80 2147483648))) (let ((.cse326 (* v_y_32 4294967296)) (.cse332 (+ v_z_78 .cse330)) (.cse331 (+ .cse329 .cse330 .cse325 .cse328))) (or (= (+ .cse325 .cse326 4294967296 .cse327 .cse328) (+ .cse329 .cse330 .cse7)) (< v_z_80 0) (< (+ .cse326 4294967296 .cse327) .cse331) (< (+ .cse329 .cse330) (+ .cse325 .cse326 .cse327 1 .cse328)) (< 4294967295 .cse332) (< .cse331 (+ .cse327 1)) (= .cse7 .cse332) (< 4294967295 .cse331))))))))) (< 4294967295 v_z_78) (< v_z_78 0))) (= .cse327 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse334 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_128 Int)) (or (< v_z_128 0) (< 4294967295 v_z_128) (forall ((v_y_128 Int)) (let ((.cse340 (* v_y_128 4294967296)) (.cse341 (* 4294967295 v_z_128))) (let ((.cse342 (+ .cse340 .cse341))) (or (forall ((v_z_132 Int) (v_y_32 Int) (v_y_132 Int)) (let ((.cse335 (* v_y_132 4294967296)) (.cse336 (* v_z_132 2147483648)) (.cse339 (* v_y_32 4294967296))) (let ((.cse337 (+ .cse340 .cse341 .cse339 .cse334)) (.cse338 (+ v_z_128 .cse336)) (.cse333 (+ .cse335 .cse340 .cse336 .cse341))) (or (< .cse333 0) (< .cse334 .cse333) (= (+ .cse335 .cse336 .cse7) .cse337) (< (+ .cse335 4294967295 .cse336) .cse337) (< v_z_132 0) (= .cse338 .cse7) (< 1 v_z_132) (= .cse338 .cse43) (< (+ .cse339 .cse334) .cse333))))) (< 2147483647 .cse342) (< .cse342 0))))))) (= .cse334 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse343 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (= .cse343 .cse7) (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (< v_z_107 0) (forall ((v_y_107 Int)) (let ((.cse345 (* v_y_107 4294967296)) (.cse346 (* 4294967295 v_z_107))) (let ((.cse344 (+ .cse345 .cse346))) (or (< 2147483647 .cse344) (< .cse344 0) (forall ((v_y_108 Int) (v_z_108 Int) (v_y_32 Int)) (let ((.cse349 (* v_y_108 4294967296)) (.cse347 (* v_y_32 4294967296)) (.cse348 (* v_z_108 2147483648))) (let ((.cse350 (+ .cse348 v_z_107)) (.cse352 (+ .cse347 .cse343)) (.cse351 (+ .cse345 .cse348 .cse346 .cse349))) (or (< 1 v_z_108) (= (+ .cse345 .cse346 .cse347 .cse343) (+ .cse348 .cse349 .cse7)) (< .cse350 4294967296) (< .cse351 0) (< .cse343 .cse351) (= .cse43 .cse350) (< (+ .cse345 .cse348 .cse346 4294967295 .cse349) .cse352) (< .cse352 .cse351)))))))))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse361 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (< v_z_107 0) (forall ((v_y_107 Int)) (let ((.cse357 (* v_y_107 4294967296)) (.cse358 (* 4294967295 v_z_107))) (let ((.cse353 (+ .cse357 .cse358))) (or (< 2147483647 .cse353) (forall ((v_z_112 Int) (v_y_112 Int) (v_y_32 Int)) (let ((.cse355 (* v_y_112 4294967296)) (.cse354 (* v_z_112 2147483648)) (.cse363 (* v_y_32 4294967296))) (let ((.cse356 (+ .cse357 .cse358 .cse363 .cse361)) (.cse360 (+ v_z_107 .cse354)) (.cse359 (+ .cse363 .cse361)) (.cse362 (+ .cse357 .cse358 .cse354 .cse355))) (or (= (+ .cse354 4294967296 .cse355 .cse7) .cse356) (< 1 v_z_112) (< (+ .cse357 .cse358 4294967295 .cse354 .cse355) .cse359) (= .cse360 .cse7) (= (+ .cse354 .cse355 .cse7) .cse356) (< .cse361 .cse362) (= .cse43 .cse360) (< .cse362 0) (< v_z_112 0) (< .cse359 .cse362))))) (< .cse353 0))))))) (= .cse361 .cse7)))) (or .cse364 .cse3) (or (and .cse65 (forall ((v_ArrVal_1144 Int)) (let ((.cse366 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_62 Int) (v_y_32 Int)) (let ((.cse365 (+ (* v_y_62 4294967296) .cse7))) (or (< .cse365 (+ (* v_y_32 8589934592) 2 (* 2 .cse366))) (< 1 v_y_62) (< v_y_32 0) (< (+ 8589934590 (* v_y_32 4294967296) .cse366) .cse365)))) (< 4294967294 .cse366) (= .cse366 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse367 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< 4294967294 .cse367) (forall ((v_y_62 Int) (v_y_32 Int)) (let ((.cse369 (* v_y_62 2147483648))) (let ((.cse370 (+ .cse369 2147483646)) (.cse368 (* v_y_32 4294967296))) (or (< (+ .cse368 .cse367 2147483646) (+ .cse369 .cse7)) (< .cse370 .cse367) (< 1 v_y_62) (< .cse370 (+ .cse368 .cse367)))))) (= .cse367 .cse7))))) .cse40) (forall ((v_ArrVal_1144 Int)) (let ((.cse377 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (forall ((v_y_107 Int)) (let ((.cse379 (* v_y_107 4294967296)) (.cse380 (* 4294967295 v_z_107))) (let ((.cse371 (+ .cse379 .cse380))) (or (< 2147483647 .cse371) (< .cse371 0) (forall ((v_z_114 Int) (v_y_114 Int) (v_y_32 Int)) (let ((.cse373 (* v_z_114 2147483648)) (.cse374 (* v_y_114 4294967296)) (.cse381 (* v_y_32 4294967296))) (let ((.cse372 (+ .cse379 .cse380 .cse381 .cse377)) (.cse376 (+ .cse379 .cse380 .cse373 .cse374)) (.cse375 (+ .cse381 .cse377)) (.cse378 (+ .cse373 v_z_107))) (or (= .cse372 (+ .cse373 .cse374 .cse7)) (< v_z_114 0) (< .cse375 .cse376) (= (+ .cse373 .cse374 4294967296 .cse7) .cse372) (< .cse377 .cse376) (= .cse378 .cse7) (< .cse376 0) (< (+ .cse379 .cse380 .cse373 4294967295 .cse374) .cse375) (< 4294967295 .cse378))))))))) (< v_z_107 0))) (= .cse377 .cse7)))) (or .cse3 .cse382) .cse185 (or .cse364 .cse40) .cse186 (or .cse3 (and .cse65 (forall ((v_ArrVal_1144 Int)) (let ((.cse384 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_59 Int) (v_y_32 Int)) (let ((.cse383 (+ (* v_y_59 4294967296) .cse7))) (or (< .cse383 (+ (* v_y_32 8589934592) 2 (* 2 .cse384))) (< 1 v_y_59) (< (+ 8589934590 (* v_y_32 4294967296) .cse384) .cse383) (< v_y_32 0)))) (< 4294967294 .cse384) (= .cse384 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse387 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_59 Int) (v_y_32 Int)) (let ((.cse386 (* v_y_32 4294967296)) (.cse385 (* v_y_59 2147483648))) (or (< 1 v_y_59) (< v_y_32 0) (< (+ .cse385 2147483646) (+ .cse386 .cse387)) (< (+ .cse386 .cse387 2147483646) (+ .cse385 .cse7))))) (< 4294967294 .cse387) (= .cse387 .cse7)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse390 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_66 Int)) (or (forall ((v_y_66 Int)) (let ((.cse393 (* v_z_66 4294967295)) (.cse394 (* v_y_66 4294967296))) (let ((.cse388 (+ .cse393 .cse394))) (or (< .cse388 0) (forall ((v_y_67 Int) (v_y_32 Int) (v_z_67 Int)) (let ((.cse396 (* v_z_67 2147483648)) (.cse397 (* v_y_67 4294967296))) (let ((.cse391 (+ .cse393 .cse396 .cse397 .cse394)) (.cse395 (+ .cse396 .cse397 .cse7)) (.cse389 (* v_y_32 4294967296)) (.cse392 (+ v_z_66 .cse396))) (or (< (+ .cse389 4294967296 .cse390) .cse391) (= .cse392 .cse43) (< .cse391 (+ .cse389 .cse390 1)) (< 1 v_z_67) (= (+ .cse393 .cse394 .cse389 .cse390) .cse395) (< .cse391 (+ .cse390 1)) (< 4294967295 .cse391) (= .cse395 (+ .cse393 .cse394 .cse389 4294967296 .cse390)) (= .cse392 .cse7) (< v_z_67 0))))) (< 2147483647 .cse388))))) (< v_z_66 0) (< 4294967295 v_z_66))) (= .cse390 .cse7)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse398 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (= .cse398 .cse7) (forall ((v_z_44 Int)) (or (< v_z_44 0) (< 4294967295 v_z_44) (forall ((v_y_44 Int)) (let ((.cse402 (* v_y_44 4294967296)) (.cse404 (* v_z_44 4294967295))) (let ((.cse399 (+ .cse402 .cse404))) (or (< .cse399 0) (< 2147483647 .cse399) (forall ((v_z_47 Int) (v_y_47 Int) (v_y_32 Int)) (let ((.cse405 (* v_y_32 4294967296)) (.cse401 (* v_z_47 2147483648)) (.cse403 (* v_y_47 4294967296))) (let ((.cse400 (+ .cse402 .cse401 .cse403 .cse404)) (.cse406 (+ .cse402 .cse404 .cse405 .cse398))) (or (< 1 v_z_47) (< .cse400 0) (= (+ .cse401 v_z_44) .cse7) (< .cse398 .cse400) (< (+ .cse402 .cse401 .cse403 4294967295 .cse404) (+ .cse405 .cse398)) (< .cse406 (+ .cse401 .cse403 4294967296)) (< v_z_47 0) (= (+ .cse401 .cse403 4294967296 .cse7) .cse406)))))))))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse407 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (= .cse407 .cse7) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse415 (* v_z_90 4294967295)) (.cse416 (* v_y_90 4294967296))) (let ((.cse408 (+ .cse415 .cse416))) (or (< .cse408 0) (forall ((v_z_94 Int) (v_y_94 Int) (v_y_32 Int)) (let ((.cse411 (* v_y_32 4294967296)) (.cse412 (* v_z_94 2147483648)) (.cse413 (* v_y_94 4294967296))) (let ((.cse409 (+ .cse412 .cse415 .cse416 .cse413)) (.cse414 (+ .cse415 .cse411 .cse416 .cse407)) (.cse410 (+ .cse412 v_z_90))) (or (< 4294967295 .cse409) (< 1 v_z_94) (< .cse410 4294967296) (< .cse409 (+ .cse407 1)) (< .cse409 (+ .cse411 .cse407 1)) (= (+ .cse412 .cse413 .cse7) .cse414) (< .cse414 (+ .cse412 .cse413)) (= .cse43 .cse410))))) (< 2147483647 .cse408)))))))))) (or .cse382 .cse40) (forall ((v_ArrVal_1144 Int)) (let ((.cse419 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_z_66 Int)) (or (< v_z_66 0) (< 4294967295 v_z_66) (forall ((v_y_66 Int)) (let ((.cse421 (* v_z_66 4294967295)) (.cse422 (* v_y_66 4294967296))) (let ((.cse417 (+ .cse421 .cse422))) (or (< .cse417 0) (< 2147483647 .cse417) (forall ((v_z_68 Int) (v_y_68 Int) (v_y_32 Int)) (let ((.cse425 (* v_z_68 2147483648)) (.cse426 (* v_y_68 4294967296))) (let ((.cse423 (+ .cse425 .cse7 .cse426)) (.cse424 (+ v_z_66 .cse425)) (.cse420 (+ .cse421 .cse425 .cse422 .cse426)) (.cse418 (* v_y_32 4294967296))) (or (< (+ .cse418 4294967296 .cse419) .cse420) (< .cse420 (+ .cse419 1)) (= (+ .cse421 .cse422 .cse418 .cse419) .cse423) (= .cse423 (+ .cse421 .cse422 .cse418 4294967296 .cse419)) (= .cse424 .cse43) (< 4294967295 .cse420) (< .cse424 4294967296) (< .cse420 (+ .cse418 .cse419 1)) (< 1 v_z_68))))))))))) (= .cse419 .cse7)))) (or .cse40 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse429 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (forall ((v_y_138 Int) (v_y_32 Int)) (let ((.cse428 (* v_y_32 4294967296)) (.cse427 (* v_y_138 2147483648))) (or (< (+ .cse427 .cse7) (+ .cse428 .cse429 1)) (< (+ .cse428 .cse429) .cse427) (< v_y_138 0) (< .cse429 .cse427)))) (= .cse429 .cse7)))) (or (forall ((v_ArrVal_1144 Int) (v_y_138 Int) (v_y_32 Int)) (let ((.cse433 (* v_y_32 4294967296)) (.cse432 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (let ((.cse431 (+ .cse433 .cse432)) (.cse430 (* v_y_138 2147483648))) (or (< (+ 4294967295 .cse430) .cse431) (< .cse431 .cse430) (< (+ (* 2 .cse432) .cse433) (+ (* v_y_138 4294967296) .cse7 1)) (< v_y_138 0) (< .cse432 .cse430) (= .cse432 .cse7))))) .cse163)))))) .cse229) .cse230) .cse231) .cse0) (or .cse232 (and (forall ((v_z_176 Int) (v_ArrVal_1144 Int)) (let ((.cse444 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< v_z_176 0) (< .cse444 (* 2 v_z_176)) (= .cse444 .cse7)))) (forall ((v_z_176 Int) (v_ArrVal_1144 Int)) (let ((.cse445 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< 2147483647 v_z_176) (< (* 2 v_z_176) (+ .cse445 1)) (= .cse445 .cse7)))) (forall ((v_z_179 Int) (v_ArrVal_1144 Int)) (let ((.cse446 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse8 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse9) 4294967296))) (or (< v_z_179 0) (< .cse446 (* 2 v_z_179)) (= .cse446 .cse7))))) .cse233)) (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (or (let ((.cse450 (and (or .cse2 .cse448) .cse229))) (and (or .cse447 (and (or .cse2 .cse448 (forall ((v_z_24 Int) (v_y_24 Int)) (let ((.cse449 (+ (* v_z_24 4294967295) (* v_y_24 4294967296)))) (or (= .cse449 .cse7) (< .cse449 0) (< 4294967295 .cse449) (= v_z_24 .cse7) (< v_z_24 0) (< 4294967295 v_z_24))))) .cse229)) (or .cse450 .cse451) (or .cse448 .cse40) (or .cse452 .cse450) (or .cse3 .cse448))) .cse0 (and (or .cse453 .cse454) .cse447)) (or .cse232 .cse230 .cse233 (and (or .cse455 .cse2) (or .cse453 .cse448 .cse454)))))))))) is different from true [2023-12-21 01:58:35,326 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (select (select |c_#memory_int#3| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset) 256))) (let ((.cse41 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.offset)) (.cse4 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.base c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base)) (.cse9 (select |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base)) (.cse8 (mod (div (* (mod (select (select |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (let ((.cse449 (forall ((v_ArrVal_1144 Int)) (= (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296) .cse8))) (.cse445 (not .cse4)) (.cse446 (not .cse41))) (let ((.cse444 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.base c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base)) (.cse443 (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var5_Pointer~0.offset)) (.cse3 (and .cse4 .cse41)) (.cse230 (or .cse449 .cse445 .cse446)) (.cse66 (forall ((v_ArrVal_1144 Int)) (< .cse8 (+ 2147483649 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))))) (.cse164 (< 4294967294 .cse8)) (.cse36 (forall ((v_ArrVal_1144 Int)) (< (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296) (+ 2147483650 .cse8)))) (.cse11 (< .cse8 1))) (let ((.cse439 (= .cse8 0)) (.cse452 (and .cse36 (or .cse11 (forall ((v_ArrVal_1144 Int)) (let ((.cse458 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< .cse458 2147483649) (= .cse458 .cse8))))))) (.cse453 (and .cse66 (or (forall ((v_ArrVal_1144 Int)) (let ((.cse457 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< 2147483647 .cse457) (= .cse457 .cse8)))) .cse164))) (.cse450 (and (or .cse3 (let ((.cse455 (forall ((v_ArrVal_1144 Int)) (let ((.cse456 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< 4294967294 .cse456) (= .cse456 .cse8)))))) (and .cse449 (or .cse455 .cse41) (or .cse4 .cse455)))) .cse230)) (.cse447 (not .cse443)) (.cse448 (not .cse444))) (let ((.cse0 (or .cse447 .cse448 (and .cse449 (forall ((v_ArrVal_1144 Int)) (let ((.cse454 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< 4294967293 .cse454) (= .cse454 .cse8))))))) (.cse2 (or .cse450 .cse443)) (.cse35 (or .cse453 .cse41)) (.cse52 (or .cse452 .cse41)) (.cse186 (or .cse4 .cse453)) (.cse187 (or .cse4 .cse452)) (.cse44 (+ 4294967296 .cse8)) (.cse40 (forall ((v_ArrVal_1144 Int)) (let ((.cse451 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< (+ .cse451 2147483646) .cse8) (< (* 2 .cse451) (+ .cse8 1)) (= .cse451 .cse8))))) (.cse232 (or .cse444 .cse450)) (.cse1 (and .cse444 .cse443)) (.cse231 (and .cse4 .cse439 .cse41)) (.cse440 (forall ((v_ArrVal_1144 Int)) (not (= (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296) 0))))) (and (or (and .cse0 (or .cse1 (and .cse2 (or (and (or .cse3 (and (or .cse4 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse6 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_194 Int) (v_y_232 Int)) (let ((.cse5 (* v_y_232 2147483648)) (.cse7 (* v_y_194 4294967296))) (or (< (+ .cse5 2147483646) .cse6) (< 4294967294 (+ .cse7 .cse6)) (< (+ .cse7 .cse6 2147483646) (+ .cse5 .cse8)) (< (+ 4294967295 .cse7 .cse6) (* v_y_232 4294967296))))) (< 4294967294 .cse6) (= .cse6 .cse8)))) (or .cse11 (forall ((v_y_194 Int) (v_ArrVal_1144 Int) (v_y_232 Int)) (let ((.cse12 (* v_y_232 2147483648)) (.cse15 (* v_y_194 4294967296)) (.cse14 (* v_y_232 4294967296)) (.cse13 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< (+ .cse12 2147483646) .cse13) (< (+ .cse14 .cse8) (+ 2 .cse15 (* 2 .cse13))) (< 4294967294 (+ .cse15 .cse13)) (< (+ 2147483647 .cse15 .cse13) .cse12) (< (+ 4294967295 .cse15 .cse13) .cse14) (= .cse13 .cse8))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse19 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_236 Int)) (or (< v_z_236 0) (< 4294967295 v_z_236) (forall ((v_y_236 Int)) (let ((.cse24 (* 4294967295 v_z_236)) (.cse25 (* v_y_236 4294967296))) (let ((.cse16 (+ .cse24 .cse25))) (or (< .cse16 0) (< 2147483647 .cse16) (forall ((v_z_242 Int) (v_y_194 Int) (v_y_242 Int)) (let ((.cse23 (* v_y_194 4294967296)) (.cse21 (* v_y_242 4294967296)) (.cse22 (* v_z_242 2147483648))) (let ((.cse18 (+ .cse21 .cse24 .cse22 .cse25)) (.cse20 (+ .cse24 .cse25 .cse23 .cse19)) (.cse17 (+ .cse22 v_z_236))) (or (< 4294967295 .cse17) (< .cse18 (+ .cse19 1)) (< v_z_242 0) (< 4294967295 .cse18) (= .cse20 (+ .cse21 .cse22 .cse8)) (< .cse18 (+ .cse23 .cse19 1)) (< .cse20 (+ .cse21 .cse22)) (= .cse17 .cse8))))))))))) (= .cse19 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse34 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_318 Int)) (or (forall ((v_y_318 Int)) (let ((.cse31 (* v_y_318 4294967296)) (.cse32 (* 4294967295 v_z_318))) (let ((.cse26 (+ .cse31 .cse32))) (or (< 2147483647 .cse26) (forall ((v_y_194 Int) (v_z_320 Int) (v_y_320 Int)) (let ((.cse33 (* v_y_194 4294967296)) (.cse28 (* v_z_320 2147483648)) (.cse30 (* v_y_320 4294967296))) (let ((.cse27 (+ .cse31 .cse28 .cse30 .cse32)) (.cse29 (+ .cse31 .cse33 .cse34 .cse32))) (or (< .cse27 0) (= (+ v_z_318 .cse28) .cse8) (< v_z_320 0) (= .cse29 (+ .cse28 .cse30 4294967296 .cse8)) (< (+ .cse31 4294967295 .cse28 .cse30 .cse32) (+ .cse33 .cse34)) (< .cse34 .cse27) (< 1 v_z_320) (< .cse29 (+ .cse28 .cse30 4294967296)))))) (< .cse26 0))))) (< v_z_318 0) (< 4294967295 v_z_318))) (= .cse34 .cse8)))) .cse35 (or (and .cse36 (forall ((v_ArrVal_1144 Int)) (let ((.cse37 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_279 Int) (v_y_189 Int)) (let ((.cse38 (* v_y_279 2147483648)) (.cse39 (* v_y_189 4294967296))) (or (< .cse37 .cse38) (< v_y_279 0) (< (+ .cse38 .cse8) (+ .cse39 .cse37 1)) (< (+ .cse39 .cse37) 0)))) (= .cse37 .cse8)))) .cse40) .cse41) (forall ((v_ArrVal_1144 Int)) (let ((.cse46 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_299 Int)) (or (forall ((v_y_299 Int)) (let ((.cse48 (* 4294967295 v_z_299)) (.cse49 (* v_y_299 4294967296))) (let ((.cse42 (+ .cse48 .cse49))) (or (< 2147483647 .cse42) (forall ((v_y_191 Int) (v_z_302 Int) (v_y_302 Int)) (let ((.cse50 (* v_y_302 4294967296)) (.cse51 (* v_z_302 2147483648))) (let ((.cse45 (+ v_z_299 .cse51)) (.cse43 (+ .cse50 .cse51 .cse48 .cse49)) (.cse47 (* v_y_191 4294967296))) (or (< 4294967295 .cse43) (= .cse44 .cse45) (< .cse43 (+ .cse46 1)) (= (+ .cse47 .cse48 4294967296 .cse46 .cse49) (+ .cse50 .cse51 .cse8)) (= .cse45 .cse8) (< 1 v_z_302) (< (+ .cse47 4294967296 .cse46) .cse43) (< v_z_302 0) (< (+ .cse50 .cse51) (+ .cse47 .cse48 .cse46 .cse49 1)))))) (< .cse42 0))))) (< v_z_299 0) (< 4294967295 v_z_299))) (= .cse46 .cse8)))) .cse52 (forall ((v_ArrVal_1144 Int)) (let ((.cse55 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_211 Int)) (or (forall ((v_y_211 Int)) (let ((.cse58 (* 4294967295 v_z_211)) (.cse59 (* v_y_211 4294967296))) (let ((.cse53 (+ .cse58 .cse59))) (or (< .cse53 0) (forall ((v_z_214 Int) (v_y_214 Int) (v_y_189 Int)) (let ((.cse61 (* v_y_214 4294967296)) (.cse62 (* v_z_214 2147483648))) (let ((.cse56 (+ .cse58 .cse59 .cse61 .cse62)) (.cse57 (+ v_z_211 .cse62)) (.cse60 (+ .cse61 .cse62 .cse8)) (.cse54 (* v_y_189 4294967296))) (or (< (+ .cse54 4294967296 .cse55) .cse56) (< .cse56 (+ .cse55 1)) (< 1 v_z_214) (< v_z_214 0) (< 4294967295 .cse56) (= .cse57 .cse8) (< .cse56 (+ .cse54 .cse55 1)) (= (+ .cse54 .cse58 .cse59 4294967296 .cse55) .cse60) (= .cse57 .cse44) (= .cse60 (+ .cse54 .cse58 .cse59 .cse55)))))) (< 2147483647 .cse53))))) (< v_z_211 0) (< 4294967295 v_z_211))) (= .cse55 .cse8)))) (or .cse4 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse64 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_217 Int) (v_y_189 Int)) (let ((.cse65 (+ (* v_y_217 4294967296) .cse8)) (.cse63 (* v_y_189 4294967296))) (or (< (+ .cse63 8589934590 .cse64) .cse65) (< 4294967294 (+ .cse63 .cse64)) (< v_y_189 0) (< 1 v_y_217) (< .cse65 (+ .cse63 2 (* 2 .cse64)))))) (< 4294967294 .cse64) (= .cse64 .cse8)))) .cse66 (forall ((v_ArrVal_1144 Int)) (let ((.cse68 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_217 Int) (v_y_189 Int)) (let ((.cse69 (* v_y_217 2147483648)) (.cse67 (* v_y_189 4294967296))) (or (< (+ .cse67 .cse68 2147483646) (+ .cse69 .cse8)) (< (+ .cse69 2147483646) (+ .cse67 .cse68)) (< v_y_189 0) (< 1 v_y_217)))) (< 4294967294 .cse68) (= .cse68 .cse8)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse73 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_236 Int)) (or (< v_z_236 0) (< 4294967295 v_z_236) (forall ((v_y_236 Int)) (let ((.cse78 (* 4294967295 v_z_236)) (.cse79 (* v_y_236 4294967296))) (let ((.cse70 (+ .cse78 .cse79))) (or (< .cse70 0) (< 2147483647 .cse70) (forall ((v_z_241 Int) (v_y_194 Int) (v_y_241 Int)) (let ((.cse74 (* v_y_194 4294967296)) (.cse76 (* v_y_241 4294967296)) (.cse75 (* v_z_241 2147483648))) (let ((.cse71 (+ .cse75 v_z_236)) (.cse72 (+ .cse75 .cse78 .cse76 .cse79)) (.cse77 (+ .cse78 .cse79 .cse74 .cse73))) (or (= .cse71 .cse44) (< .cse72 (+ .cse73 1)) (< .cse72 (+ .cse74 .cse73 1)) (< .cse71 4294967296) (< 4294967295 .cse72) (= (+ .cse75 .cse76 .cse8) .cse77) (< .cse77 (+ .cse75 .cse76)) (< 1 v_z_241))))))))))) (= .cse73 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse80 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (= .cse80 .cse8) (forall ((v_z_283 Int)) (or (forall ((v_y_283 Int)) (let ((.cse87 (* v_y_283 4294967296)) (.cse88 (* 4294967295 v_z_283))) (let ((.cse81 (+ .cse87 .cse88))) (or (< .cse81 0) (< 2147483647 .cse81) (forall ((v_z_284 Int) (v_y_284 Int) (v_y_189 Int)) (let ((.cse84 (* v_y_284 4294967296)) (.cse85 (* v_z_284 2147483648)) (.cse90 (* v_y_189 4294967296))) (let ((.cse86 (+ .cse90 .cse87 .cse80 .cse88)) (.cse83 (+ v_z_283 .cse85)) (.cse89 (+ .cse90 .cse80)) (.cse82 (+ .cse84 .cse87 .cse85 .cse88))) (or (< .cse82 0) (< 4294967295 .cse83) (= (+ .cse84 .cse85 .cse8) .cse86) (= (+ .cse84 .cse85 4294967296 .cse8) .cse86) (= .cse83 .cse8) (< (+ .cse84 .cse87 4294967295 .cse85 .cse88) .cse89) (< .cse89 .cse82) (< v_z_284 0) (< .cse80 .cse82))))))))) (< v_z_283 0) (< 4294967295 v_z_283)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse93 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_211 Int)) (or (< v_z_211 0) (< 4294967295 v_z_211) (forall ((v_y_211 Int)) (let ((.cse96 (* 4294967295 v_z_211)) (.cse97 (* v_y_211 4294967296))) (let ((.cse91 (+ .cse96 .cse97))) (or (< .cse91 0) (forall ((v_z_214 Int) (v_y_214 Int) (v_y_189 Int)) (let ((.cse99 (* v_y_214 4294967296)) (.cse100 (* v_z_214 2147483648))) (let ((.cse95 (+ v_z_211 .cse100)) (.cse94 (+ .cse96 .cse97 .cse99 .cse100)) (.cse98 (+ .cse99 .cse100 .cse8)) (.cse92 (* v_y_189 4294967296))) (or (< (+ .cse92 4294967296 .cse93) .cse94) (< .cse94 (+ .cse93 1)) (< 4294967295 .cse95) (< v_z_214 0) (< 4294967295 .cse94) (= .cse95 .cse8) (< .cse94 (+ .cse92 .cse93 1)) (= (+ .cse92 .cse96 .cse97 4294967296 .cse93) .cse98) (= .cse98 (+ .cse92 .cse96 .cse97 .cse93)))))) (< 2147483647 .cse91))))))) (= .cse93 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse103 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_299 Int)) (or (forall ((v_y_299 Int)) (let ((.cse105 (* 4294967295 v_z_299)) (.cse106 (* v_y_299 4294967296))) (let ((.cse109 (+ .cse105 .cse106))) (or (forall ((v_y_191 Int) (v_z_302 Int) (v_y_302 Int)) (let ((.cse107 (* v_y_302 4294967296)) (.cse108 (* v_z_302 2147483648))) (let ((.cse101 (+ .cse107 .cse108 .cse105 .cse106)) (.cse102 (+ v_z_299 .cse108)) (.cse104 (* v_y_191 4294967296))) (or (< 4294967295 .cse101) (= .cse44 .cse102) (< .cse101 (+ .cse103 1)) (= (+ .cse104 .cse105 4294967296 .cse103 .cse106) (+ .cse107 .cse108 .cse8)) (< 1 v_z_302) (< (+ .cse104 4294967296 .cse103) .cse101) (< .cse102 4294967296) (< (+ .cse107 .cse108) (+ .cse104 .cse105 .cse103 .cse106 1)))))) (< 2147483647 .cse109) (< .cse109 0))))) (< v_z_299 0) (< 4294967295 v_z_299))) (= .cse103 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse118 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_283 Int)) (or (< v_z_283 0) (forall ((v_y_283 Int)) (let ((.cse112 (* v_y_283 4294967296)) (.cse114 (* 4294967295 v_z_283))) (let ((.cse110 (+ .cse112 .cse114))) (or (< .cse110 0) (< 2147483647 .cse110) (forall ((v_z_289 Int) (v_y_289 Int) (v_y_189 Int)) (let ((.cse113 (* v_y_289 4294967296)) (.cse111 (* v_z_289 2147483648)) (.cse119 (* v_y_189 4294967296))) (let ((.cse115 (+ .cse119 .cse118)) (.cse116 (+ .cse111 v_z_283)) (.cse117 (+ .cse111 .cse112 .cse113 .cse114))) (or (< (+ .cse111 .cse112 4294967295 .cse113 .cse114) .cse115) (< .cse116 4294967296) (< .cse117 0) (< 1 v_z_289) (< .cse115 .cse117) (= .cse116 .cse44) (< .cse118 .cse117) (= (+ .cse111 .cse113 .cse8) (+ .cse119 .cse112 .cse118 .cse114)))))))))) (< 4294967295 v_z_283))) (= .cse118 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse129 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_283 Int)) (or (< v_z_283 0) (forall ((v_y_283 Int)) (let ((.cse127 (* v_y_283 4294967296)) (.cse128 (* 4294967295 v_z_283))) (let ((.cse120 (+ .cse127 .cse128))) (or (< .cse120 0) (< 2147483647 .cse120) (forall ((v_z_288 Int) (v_y_189 Int) (v_y_288 Int)) (let ((.cse122 (* v_y_288 4294967296)) (.cse123 (* v_z_288 2147483648)) (.cse130 (* v_y_189 4294967296))) (let ((.cse124 (+ .cse130 .cse127 .cse129 .cse128)) (.cse121 (+ .cse123 v_z_283)) (.cse126 (+ .cse130 .cse129)) (.cse125 (+ .cse122 .cse127 .cse123 .cse128))) (or (= .cse44 .cse121) (= (+ .cse122 .cse123 .cse8) .cse124) (< .cse125 0) (= (+ .cse122 .cse123 4294967296 .cse8) .cse124) (< .cse126 .cse125) (= .cse121 .cse8) (< v_z_288 0) (< (+ .cse122 .cse127 4294967295 .cse123 .cse128) .cse126) (< 1 v_z_288) (< .cse129 .cse125))))))))) (< 4294967295 v_z_283))) (= .cse129 .cse8)))) (or .cse41 (and .cse66 (forall ((v_ArrVal_1144 Int)) (let ((.cse132 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_215 Int) (v_y_189 Int)) (let ((.cse131 (* v_y_189 4294967296))) (or (< (+ (* v_y_215 4294967296) .cse8) (+ .cse131 2 (* 2 .cse132))) (< 1 v_y_215) (< 4294967294 (+ .cse131 .cse132)) (< v_y_189 0) (< (+ .cse131 6442450942 .cse132) (+ (* v_y_215 2147483648) .cse8))))) (< 4294967294 .cse132) (= .cse132 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse134 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_215 Int) (v_y_189 Int)) (let ((.cse135 (* v_y_215 2147483648)) (.cse133 (* v_y_189 4294967296))) (or (< (+ .cse133 .cse134 2147483646) (+ .cse135 .cse8)) (< (+ .cse135 2147483646) .cse134) (< 1 v_y_215) (< 4294967294 (+ .cse133 .cse134))))) (< 4294967294 .cse134) (= .cse134 .cse8)))))) (or (and .cse36 .cse40 (forall ((v_ArrVal_1144 Int)) (let ((.cse140 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_189 Int) (v_y_277 Int)) (let ((.cse139 (* v_y_189 4294967296))) (let ((.cse136 (* v_y_277 2147483648)) (.cse137 (+ .cse139 .cse140 1)) (.cse138 (+ .cse139 .cse140))) (or (< (+ .cse136 .cse8) .cse137) (< .cse138 .cse136) (< (+ (* v_y_277 4294967296) .cse8) .cse137) (< 0 v_y_189) (< .cse138 0))))) (= .cse140 .cse8))))) .cse4) (forall ((v_ArrVal_1144 Int)) (let ((.cse148 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_259 Int)) (or (forall ((v_y_259 Int)) (let ((.cse149 (* 4294967295 v_z_259)) (.cse150 (* v_y_259 4294967296))) (let ((.cse141 (+ .cse149 .cse150))) (or (< .cse141 0) (< 2147483647 .cse141) (forall ((v_z_262 Int) (v_y_262 Int) (v_y_191 Int)) (let ((.cse142 (* v_y_262 4294967296)) (.cse143 (* v_z_262 2147483648)) (.cse147 (* v_y_191 4294967296))) (let ((.cse144 (+ .cse147 .cse149 .cse150 .cse148)) (.cse146 (+ v_z_259 .cse143)) (.cse145 (+ .cse142 .cse149 .cse150 .cse143))) (or (< (+ .cse142 4294967295 .cse143) .cse144) (= .cse144 (+ .cse142 .cse143 .cse8)) (< .cse145 0) (< .cse146 4294967296) (< (+ .cse147 .cse148) .cse145) (< 1 v_z_262) (= .cse44 .cse146) (< .cse148 .cse145))))))))) (< 4294967295 v_z_259) (< v_z_259 0))) (= .cse148 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse154 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_211 Int)) (or (forall ((v_y_211 Int)) (let ((.cse157 (* 4294967295 v_z_211)) (.cse158 (* v_y_211 4294967296))) (let ((.cse151 (+ .cse157 .cse158))) (or (< .cse151 0) (forall ((v_z_213 Int) (v_y_213 Int) (v_y_189 Int)) (let ((.cse159 (* v_z_213 2147483648)) (.cse160 (* v_y_213 4294967296))) (let ((.cse155 (+ .cse159 .cse160 .cse8)) (.cse152 (+ .cse159 v_z_211)) (.cse156 (* v_y_189 4294967296)) (.cse153 (+ .cse159 .cse157 .cse158 .cse160))) (or (= .cse44 .cse152) (< .cse153 (+ .cse154 1)) (= .cse155 (+ .cse156 .cse157 .cse158 4294967296 .cse154)) (< 4294967295 .cse153) (< 1 v_z_213) (= .cse155 (+ .cse156 .cse157 .cse158 .cse154)) (< .cse153 (+ .cse156 .cse154 1)) (< .cse152 4294967296) (< (+ .cse156 4294967296 .cse154) .cse153))))) (< 2147483647 .cse151))))) (< v_z_211 0) (< 4294967295 v_z_211))) (= .cse154 .cse8)))) (or .cse41 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse162 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_191 Int) (v_y_254 Int)) (let ((.cse161 (* v_y_191 4294967296)) (.cse163 (* v_y_254 2147483648))) (or (< v_y_254 0) (< (+ .cse161 .cse162) .cse163) (< (+ .cse163 .cse8) (+ .cse161 .cse162 1)) (< .cse162 .cse163)))) (= .cse162 .cse8)))) (or .cse164 (forall ((v_y_191 Int) (v_ArrVal_1144 Int) (v_y_254 Int)) (let ((.cse166 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296)) (.cse165 (* v_y_254 2147483648))) (or (< v_y_254 0) (< (+ 4294967295 .cse165) (+ (* v_y_191 4294967296) .cse166)) (< (+ (* 2 .cse166) (* 8589934592 v_y_191)) (+ (* v_y_254 4294967296) .cse8 1)) (= .cse166 .cse8) (< .cse166 .cse165))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse173 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_259 Int)) (or (forall ((v_y_259 Int)) (let ((.cse175 (* 4294967295 v_z_259)) (.cse176 (* v_y_259 4294967296))) (let ((.cse167 (+ .cse175 .cse176))) (or (< .cse167 0) (< 2147483647 .cse167) (forall ((v_y_260 Int) (v_y_191 Int) (v_z_260 Int)) (let ((.cse172 (* v_y_191 4294967296)) (.cse169 (* v_y_260 4294967296)) (.cse168 (* v_z_260 2147483648))) (let ((.cse171 (+ .cse168 v_z_259)) (.cse174 (+ .cse168 .cse169 .cse175 .cse176)) (.cse170 (+ .cse172 .cse175 .cse176 .cse173))) (or (< (+ .cse168 4294967295 .cse169) .cse170) (< 4294967295 .cse171) (< (+ .cse172 .cse173) .cse174) (< .cse173 .cse174) (= .cse171 .cse8) (< .cse174 0) (= .cse170 (+ .cse168 .cse169 .cse8)) (< v_z_260 0))))))))) (< 4294967295 v_z_259) (< v_z_259 0))) (= .cse173 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse179 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_299 Int)) (or (forall ((v_y_299 Int)) (let ((.cse182 (* 4294967295 v_z_299)) (.cse183 (* v_y_299 4294967296))) (let ((.cse177 (+ .cse182 .cse183))) (or (< 2147483647 .cse177) (forall ((v_y_191 Int) (v_z_301 Int) (v_y_301 Int)) (let ((.cse185 (* v_y_301 4294967296)) (.cse184 (* v_z_301 2147483648))) (let ((.cse180 (+ v_z_299 .cse184)) (.cse181 (* v_y_191 4294967296)) (.cse178 (+ .cse184 .cse182 .cse185 .cse183))) (or (< .cse178 (+ .cse179 1)) (= .cse180 .cse8) (= (+ .cse181 .cse182 4294967296 .cse179 .cse183) (+ .cse184 .cse185 .cse8)) (< v_z_301 0) (< 4294967295 .cse180) (< 4294967295 .cse178) (< (+ .cse184 .cse185) (+ .cse181 .cse182 .cse179 .cse183 1)) (< (+ .cse181 4294967296 .cse179) .cse178))))) (< .cse177 0))))) (< v_z_299 0) (< 4294967295 v_z_299))) (= .cse179 .cse8)))) .cse186 .cse187 (forall ((v_ArrVal_1144 Int)) (let ((.cse190 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_318 Int)) (or (forall ((v_y_318 Int)) (let ((.cse194 (* v_y_318 4294967296)) (.cse195 (* 4294967295 v_z_318))) (let ((.cse188 (+ .cse194 .cse195))) (or (< 2147483647 .cse188) (forall ((v_y_319 Int) (v_y_194 Int) (v_z_319 Int)) (let ((.cse196 (* v_y_194 4294967296)) (.cse192 (* v_z_319 2147483648)) (.cse193 (* v_y_319 4294967296))) (let ((.cse189 (+ .cse192 .cse194 .cse193 .cse195)) (.cse191 (+ .cse194 .cse196 .cse190 .cse195))) (or (< .cse189 0) (< 1 v_z_319) (< .cse190 .cse189) (< .cse191 (+ .cse192 .cse193 4294967296)) (< v_z_319 0) (< (+ .cse192 .cse194 4294967295 .cse193 .cse195) (+ .cse196 .cse190)) (= (+ .cse192 v_z_318) .cse8) (= .cse191 (+ .cse192 .cse193 4294967296 .cse8)))))) (< .cse188 0))))) (< v_z_318 0) (< 4294967295 v_z_318))) (= .cse190 .cse8)))) (or (and (forall ((v_ArrVal_1144 Int)) (let ((.cse198 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_191 Int) (v_y_264 Int)) (let ((.cse197 (* v_y_191 4294967296)) (.cse199 (* v_y_264 2147483648))) (or (< (+ .cse197 .cse198) .cse199) (< v_y_264 0) (< (+ .cse199 .cse8) (+ .cse197 .cse198 1)) (< .cse198 .cse199)))) (= .cse198 .cse8)))) (or (forall ((v_y_191 Int) (v_ArrVal_1144 Int) (v_y_264 Int)) (let ((.cse203 (* v_y_191 4294967296)) (.cse202 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (let ((.cse201 (* v_y_264 2147483648)) (.cse200 (+ .cse203 .cse202))) (or (< .cse200 .cse201) (< v_y_264 0) (< .cse202 .cse201) (< (+ .cse203 (* 2 .cse202)) (+ (* v_y_264 4294967296) .cse8 1)) (< (+ .cse201 4294967295) .cse200) (= .cse202 .cse8))))) .cse164)) .cse4) (forall ((v_ArrVal_1144 Int)) (let ((.cse209 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_259 Int)) (or (forall ((v_y_259 Int)) (let ((.cse212 (* 4294967295 v_z_259)) (.cse213 (* v_y_259 4294967296))) (let ((.cse204 (+ .cse212 .cse213))) (or (< .cse204 0) (< 2147483647 .cse204) (forall ((v_y_260 Int) (v_y_191 Int) (v_z_260 Int)) (let ((.cse208 (* v_y_191 4294967296)) (.cse205 (* v_z_260 2147483648)) (.cse206 (* v_y_260 4294967296))) (let ((.cse210 (+ .cse205 .cse206 .cse212 .cse213)) (.cse207 (+ .cse208 .cse212 .cse213 .cse209)) (.cse211 (+ .cse205 v_z_259))) (or (< (+ .cse205 4294967295 .cse206) .cse207) (< 1 v_z_260) (< (+ .cse208 .cse209) .cse210) (< .cse209 .cse210) (= .cse211 .cse8) (< .cse210 0) (= .cse207 (+ .cse205 .cse206 .cse8)) (= .cse211 .cse44) (< v_z_260 0))))))))) (< 4294967295 v_z_259) (< v_z_259 0))) (= .cse209 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse214 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (= .cse214 .cse8) (forall ((v_z_236 Int)) (or (< v_z_236 0) (< 4294967295 v_z_236) (forall ((v_y_236 Int)) (let ((.cse221 (* 4294967295 v_z_236)) (.cse222 (* v_y_236 4294967296))) (let ((.cse223 (+ .cse221 .cse222))) (or (forall ((v_y_194 Int) (v_y_238 Int) (v_z_238 Int)) (let ((.cse219 (* v_y_238 4294967296)) (.cse217 (* v_y_194 4294967296)) (.cse220 (* v_z_238 2147483648))) (let ((.cse215 (+ v_z_236 .cse220)) (.cse218 (+ .cse221 .cse222 .cse217 .cse214)) (.cse216 (+ .cse221 .cse222 .cse219 .cse220))) (or (< 1 v_z_238) (= .cse215 .cse44) (< v_z_238 0) (< .cse216 (+ .cse214 1)) (< .cse216 (+ .cse217 .cse214 1)) (= .cse215 .cse8) (< .cse218 (+ .cse219 .cse220)) (= .cse218 (+ .cse219 .cse8 .cse220)) (< 4294967295 .cse216))))) (< .cse223 0) (< 2147483647 .cse223)))))))))) (or (and (forall ((v_ArrVal_1144 Int)) (let ((.cse225 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_194 Int) (v_y_229 Int)) (let ((.cse224 (* v_y_194 4294967296)) (.cse226 (* v_y_229 2147483648))) (or (< 4294967294 (+ .cse224 .cse225)) (< (+ .cse226 2147483646) .cse225) (< (+ .cse224 .cse225 2147483646) (+ .cse226 .cse8)) (< 1 v_y_229)))) (< 4294967294 .cse225) (= .cse225 .cse8)))) (or .cse11 (forall ((v_y_194 Int) (v_y_229 Int) (v_ArrVal_1144 Int)) (let ((.cse229 (* v_y_229 2147483648)) (.cse227 (* v_y_194 4294967296)) (.cse228 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< (+ 2147483647 .cse227 .cse228) .cse229) (< 4294967294 (+ .cse227 .cse228)) (< (+ .cse229 2147483646) .cse228) (< (+ (* v_y_229 4294967296) .cse8) (+ 2 .cse227 (* 2 .cse228))) (= .cse228 .cse8) (< 1 v_y_229)))))) .cse41))) .cse230) .cse231) .cse232))) (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) (or (= c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) (and .cse0 (or (and .cse2 (or (and (or .cse3 (let ((.cse359 (and (or .cse11 (forall ((v_ArrVal_1144 Int) (v_y_32 Int) (v_y_88 Int)) (let ((.cse434 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296)) (.cse433 (* v_y_88 2147483648))) (or (< (+ .cse433 2147483646) .cse434) (< (+ (* v_y_88 4294967296) .cse8) (+ (* v_y_32 8589934592) 2 (* 2 .cse434))) (= .cse434 .cse8) (< 1 v_y_88) (< (+ 2147483647 (* v_y_32 4294967296) .cse434) .cse433))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse436 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_32 Int) (v_y_88 Int)) (let ((.cse438 (* v_y_88 2147483648))) (let ((.cse435 (+ .cse438 2147483646)) (.cse437 (* v_y_32 4294967296))) (or (< .cse435 .cse436) (< (+ .cse437 .cse436 2147483646) (+ .cse438 .cse8)) (< .cse435 (+ .cse437 .cse436)) (< 1 v_y_88))))) (< 4294967294 .cse436) (= .cse436 .cse8)))))) (.cse377 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse429 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_105 Int) (v_y_32 Int)) (let ((.cse431 (* v_y_32 4294967296))) (let ((.cse430 (* v_y_105 2147483648)) (.cse432 (+ .cse431 .cse429 1))) (or (< .cse429 .cse430) (< (+ .cse431 .cse429) 0) (< (+ .cse8 (* v_y_105 4294967296)) .cse432) (< (+ .cse430 .cse8) .cse432))))) (= .cse429 .cse8)))) .cse36 .cse40))) (and .cse35 (or .cse4 (and (or (forall ((v_ArrVal_1144 Int) (v_y_137 Int) (v_y_32 Int)) (let ((.cse233 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (let ((.cse235 (* v_y_137 2147483648)) (.cse234 (* v_y_137 4294967296)) (.cse236 (+ (* v_y_32 4294967296) .cse233))) (or (< (+ (* v_y_32 8589934592) (* 2 .cse233)) (+ .cse234 .cse8 1)) (< (+ .cse235 4294967295) .cse236) (< .cse236 0) (< .cse233 .cse235) (= .cse233 .cse8) (< (+ .cse234 4294967295) .cse236))))) .cse164) (forall ((v_ArrVal_1144 Int)) (let ((.cse238 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_137 Int) (v_y_32 Int)) (let ((.cse237 (* v_y_32 4294967296))) (let ((.cse239 (* v_y_137 2147483648)) (.cse240 (+ .cse237 .cse238 1))) (or (< (+ .cse237 .cse238) 0) (< .cse238 .cse239) (< (+ .cse239 .cse8) .cse240) (< (+ (* v_y_137 4294967296) .cse8) .cse240))))) (= .cse238 .cse8)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse241 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (= .cse241 .cse8) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse249 (* v_z_90 4294967295)) (.cse250 (* v_y_90 4294967296))) (let ((.cse242 (+ .cse249 .cse250))) (or (< .cse242 0) (< 2147483647 .cse242) (forall ((v_z_91 Int) (v_y_91 Int) (v_y_32 Int)) (let ((.cse247 (* v_y_32 4294967296)) (.cse244 (* v_z_91 2147483648)) (.cse245 (* v_y_91 4294967296))) (let ((.cse243 (+ .cse244 .cse245 .cse249 .cse250)) (.cse248 (+ v_z_90 .cse244)) (.cse246 (+ .cse249 .cse247 .cse250 .cse241))) (or (< .cse243 (+ .cse241 1)) (= (+ .cse244 .cse245 .cse8) .cse246) (< 4294967295 .cse243) (< v_z_91 0) (< .cse243 (+ .cse247 .cse241 1)) (< 4294967295 .cse248) (= .cse248 .cse8) (< .cse246 (+ .cse244 .cse245))))))))))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse251 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_128 Int)) (or (< v_z_128 0) (< 4294967295 v_z_128) (forall ((v_y_128 Int)) (let ((.cse258 (* v_y_128 4294967296)) (.cse259 (* 4294967295 v_z_128))) (let ((.cse260 (+ .cse258 .cse259))) (or (forall ((v_z_130 Int) (v_y_130 Int) (v_y_32 Int)) (let ((.cse257 (* v_y_32 4294967296)) (.cse255 (* v_y_130 4294967296)) (.cse254 (* v_z_130 2147483648))) (let ((.cse253 (+ .cse254 v_z_128)) (.cse252 (+ .cse254 .cse258 .cse259 .cse255)) (.cse256 (+ .cse258 .cse259 .cse257 .cse251))) (or (< .cse251 .cse252) (< .cse252 0) (< v_z_130 0) (< 4294967295 .cse253) (< (+ .cse254 4294967295 .cse255) .cse256) (= .cse253 .cse8) (< (+ .cse257 .cse251) .cse252) (= (+ .cse254 .cse255 .cse8) .cse256))))) (< 2147483647 .cse260) (< .cse260 0))))))) (= .cse251 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse264 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_44 Int)) (or (forall ((v_y_44 Int)) (let ((.cse265 (* v_y_44 4294967296)) (.cse268 (* v_z_44 4294967295))) (let ((.cse261 (+ .cse265 .cse268))) (or (< .cse261 0) (< 2147483647 .cse261) (forall ((v_z_47 Int) (v_y_47 Int) (v_y_32 Int)) (let ((.cse269 (* v_y_32 4294967296)) (.cse266 (* v_z_47 2147483648)) (.cse267 (* v_y_47 4294967296))) (let ((.cse262 (+ .cse265 .cse266 .cse267 .cse268)) (.cse263 (+ .cse266 v_z_44)) (.cse270 (+ .cse265 .cse268 .cse269 .cse264))) (or (< .cse262 0) (= .cse263 .cse8) (< .cse264 .cse262) (< (+ .cse265 .cse266 .cse267 4294967295 .cse268) (+ .cse269 .cse264)) (< .cse270 (+ .cse266 .cse267 4294967296)) (< v_z_47 0) (< 4294967295 .cse263) (= (+ .cse266 .cse267 4294967296 .cse8) .cse270))))))))) (< v_z_44 0) (< 4294967295 v_z_44))) (= .cse264 .cse8)))) .cse52 (forall ((v_ArrVal_1144 Int)) (let ((.cse271 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_128 Int)) (or (forall ((v_y_128 Int)) (let ((.cse278 (* v_y_128 4294967296)) (.cse279 (* 4294967295 v_z_128))) (let ((.cse280 (+ .cse278 .cse279))) (or (forall ((v_z_135 Int) (v_y_135 Int) (v_y_32 Int)) (let ((.cse276 (* v_y_32 4294967296)) (.cse273 (* v_z_135 2147483648)) (.cse274 (* v_y_135 4294967296))) (let ((.cse272 (+ .cse273 .cse278 .cse279 .cse274)) (.cse275 (+ .cse278 .cse279 .cse276 .cse271)) (.cse277 (+ .cse273 v_z_128))) (or (< .cse271 .cse272) (< (+ 4294967295 .cse273 .cse274) .cse275) (< 1 v_z_135) (< .cse272 0) (< (+ .cse276 .cse271) .cse272) (< .cse277 4294967296) (= (+ .cse273 .cse274 .cse8) .cse275) (= .cse44 .cse277))))) (< 2147483647 .cse280) (< .cse280 0))))) (< v_z_128 0) (< 4294967295 v_z_128))) (= .cse271 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse284 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_78 Int)) (or (forall ((v_y_78 Int)) (let ((.cse282 (* v_y_78 4294967296)) (.cse285 (* v_z_78 4294967295))) (let ((.cse281 (+ .cse282 .cse285))) (or (< 2147483647 .cse281) (< .cse281 0) (forall ((v_z_81 Int) (v_y_81 Int) (v_y_32 Int)) (let ((.cse287 (* v_y_81 4294967296)) (.cse286 (* v_z_81 2147483648))) (let ((.cse289 (+ v_z_78 .cse286)) (.cse283 (* v_y_32 4294967296)) (.cse288 (+ .cse286 .cse282 .cse285 .cse287))) (or (= (+ .cse282 .cse283 4294967296 .cse284 .cse285) (+ .cse286 .cse8 .cse287)) (< 4294967295 .cse288) (< .cse289 4294967296) (< (+ .cse283 4294967296 .cse284) .cse288) (= .cse289 .cse44) (< (+ .cse286 .cse287) (+ .cse282 .cse283 .cse284 1 .cse285)) (< .cse288 (+ .cse284 1)) (< 1 v_z_81))))))))) (< 4294967295 v_z_78) (< v_z_78 0))) (= .cse284 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse292 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_66 Int)) (or (< v_z_66 0) (forall ((v_y_66 Int)) (let ((.cse295 (* v_z_66 4294967295)) (.cse296 (* v_y_66 4294967296))) (let ((.cse290 (+ .cse295 .cse296))) (or (< .cse290 0) (forall ((v_y_67 Int) (v_y_32 Int) (v_z_67 Int)) (let ((.cse298 (* v_z_67 2147483648)) (.cse299 (* v_y_67 4294967296))) (let ((.cse293 (+ .cse295 .cse298 .cse299 .cse296)) (.cse297 (+ .cse298 .cse299 .cse8)) (.cse291 (* v_y_32 4294967296)) (.cse294 (+ v_z_66 .cse298))) (or (< (+ .cse291 4294967296 .cse292) .cse293) (< 4294967295 .cse294) (< .cse293 (+ .cse291 .cse292 1)) (= (+ .cse295 .cse296 .cse291 .cse292) .cse297) (< .cse293 (+ .cse292 1)) (< 4294967295 .cse293) (= .cse297 (+ .cse295 .cse296 .cse291 4294967296 .cse292)) (= .cse294 .cse8) (< v_z_67 0))))) (< 2147483647 .cse290))))) (< 4294967295 v_z_66))) (= .cse292 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse302 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse308 (* v_z_90 4294967295)) (.cse309 (* v_y_90 4294967296))) (let ((.cse300 (+ .cse308 .cse309))) (or (< .cse300 0) (forall ((v_z_96 Int) (v_y_96 Int) (v_y_32 Int)) (let ((.cse304 (* v_y_96 4294967296)) (.cse305 (* v_z_96 2147483648)) (.cse306 (* v_y_32 4294967296))) (let ((.cse303 (+ .cse308 .cse306 .cse309 .cse302)) (.cse307 (+ v_z_90 .cse305)) (.cse301 (+ .cse304 .cse308 .cse305 .cse309))) (or (< .cse301 (+ .cse302 1)) (< v_z_96 0) (< .cse303 (+ .cse304 .cse305)) (< .cse301 (+ .cse306 .cse302 1)) (= .cse307 .cse44) (< 1 v_z_96) (= .cse303 (+ .cse304 .cse305 .cse8)) (= .cse307 .cse8) (< 4294967295 .cse301))))) (< 2147483647 .cse300))))))) (= .cse302 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse313 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_78 Int)) (or (< 4294967295 v_z_78) (forall ((v_y_78 Int)) (let ((.cse311 (* v_y_78 4294967296)) (.cse314 (* v_z_78 4294967295))) (let ((.cse310 (+ .cse311 .cse314))) (or (< 2147483647 .cse310) (< .cse310 0) (forall ((v_z_81 Int) (v_y_81 Int) (v_y_32 Int)) (let ((.cse316 (* v_y_81 4294967296)) (.cse315 (* v_z_81 2147483648))) (let ((.cse318 (+ v_z_78 .cse315)) (.cse312 (* v_y_32 4294967296)) (.cse317 (+ .cse315 .cse311 .cse314 .cse316))) (or (= (+ .cse311 .cse312 4294967296 .cse313 .cse314) (+ .cse315 .cse8 .cse316)) (< 4294967295 .cse317) (= .cse318 .cse8) (< (+ .cse312 4294967296 .cse313) .cse317) (< v_z_81 0) (= .cse318 .cse44) (< (+ .cse315 .cse316) (+ .cse311 .cse312 .cse313 1 .cse314)) (< .cse317 (+ .cse313 1)) (< 1 v_z_81))))))))) (< v_z_78 0))) (= .cse313 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse322 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_78 Int)) (or (forall ((v_y_78 Int)) (let ((.cse320 (* v_y_78 4294967296)) (.cse323 (* v_z_78 4294967295))) (let ((.cse319 (+ .cse320 .cse323))) (or (< 2147483647 .cse319) (< .cse319 0) (forall ((v_y_80 Int) (v_z_80 Int) (v_y_32 Int)) (let ((.cse324 (* v_y_80 4294967296)) (.cse325 (* v_z_80 2147483648))) (let ((.cse321 (* v_y_32 4294967296)) (.cse327 (+ v_z_78 .cse325)) (.cse326 (+ .cse324 .cse325 .cse320 .cse323))) (or (= (+ .cse320 .cse321 4294967296 .cse322 .cse323) (+ .cse324 .cse325 .cse8)) (< v_z_80 0) (< (+ .cse321 4294967296 .cse322) .cse326) (< (+ .cse324 .cse325) (+ .cse320 .cse321 .cse322 1 .cse323)) (< 4294967295 .cse327) (< .cse326 (+ .cse322 1)) (= .cse8 .cse327) (< 4294967295 .cse326))))))))) (< 4294967295 v_z_78) (< v_z_78 0))) (= .cse322 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse329 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_128 Int)) (or (< v_z_128 0) (< 4294967295 v_z_128) (forall ((v_y_128 Int)) (let ((.cse335 (* v_y_128 4294967296)) (.cse336 (* 4294967295 v_z_128))) (let ((.cse337 (+ .cse335 .cse336))) (or (forall ((v_z_132 Int) (v_y_32 Int) (v_y_132 Int)) (let ((.cse330 (* v_y_132 4294967296)) (.cse331 (* v_z_132 2147483648)) (.cse334 (* v_y_32 4294967296))) (let ((.cse332 (+ .cse335 .cse336 .cse334 .cse329)) (.cse333 (+ v_z_128 .cse331)) (.cse328 (+ .cse330 .cse335 .cse331 .cse336))) (or (< .cse328 0) (< .cse329 .cse328) (= (+ .cse330 .cse331 .cse8) .cse332) (< (+ .cse330 4294967295 .cse331) .cse332) (< v_z_132 0) (= .cse333 .cse8) (< 1 v_z_132) (= .cse333 .cse44) (< (+ .cse334 .cse329) .cse328))))) (< 2147483647 .cse337) (< .cse337 0))))))) (= .cse329 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse338 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (= .cse338 .cse8) (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (< v_z_107 0) (forall ((v_y_107 Int)) (let ((.cse340 (* v_y_107 4294967296)) (.cse341 (* 4294967295 v_z_107))) (let ((.cse339 (+ .cse340 .cse341))) (or (< 2147483647 .cse339) (< .cse339 0) (forall ((v_y_108 Int) (v_z_108 Int) (v_y_32 Int)) (let ((.cse344 (* v_y_108 4294967296)) (.cse342 (* v_y_32 4294967296)) (.cse343 (* v_z_108 2147483648))) (let ((.cse345 (+ .cse343 v_z_107)) (.cse347 (+ .cse342 .cse338)) (.cse346 (+ .cse340 .cse343 .cse341 .cse344))) (or (< 1 v_z_108) (= (+ .cse340 .cse341 .cse342 .cse338) (+ .cse343 .cse344 .cse8)) (< .cse345 4294967296) (< .cse346 0) (< .cse338 .cse346) (= .cse44 .cse345) (< (+ .cse340 .cse343 .cse341 4294967295 .cse344) .cse347) (< .cse347 .cse346)))))))))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse356 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (< v_z_107 0) (forall ((v_y_107 Int)) (let ((.cse352 (* v_y_107 4294967296)) (.cse353 (* 4294967295 v_z_107))) (let ((.cse348 (+ .cse352 .cse353))) (or (< 2147483647 .cse348) (forall ((v_z_112 Int) (v_y_112 Int) (v_y_32 Int)) (let ((.cse350 (* v_y_112 4294967296)) (.cse349 (* v_z_112 2147483648)) (.cse358 (* v_y_32 4294967296))) (let ((.cse351 (+ .cse352 .cse353 .cse358 .cse356)) (.cse355 (+ v_z_107 .cse349)) (.cse354 (+ .cse358 .cse356)) (.cse357 (+ .cse352 .cse353 .cse349 .cse350))) (or (= (+ .cse349 4294967296 .cse350 .cse8) .cse351) (< 1 v_z_112) (< (+ .cse352 .cse353 4294967295 .cse349 .cse350) .cse354) (= .cse355 .cse8) (= (+ .cse349 .cse350 .cse8) .cse351) (< .cse356 .cse357) (= .cse44 .cse355) (< .cse357 0) (< v_z_112 0) (< .cse354 .cse357))))) (< .cse348 0))))))) (= .cse356 .cse8)))) (or .cse359 .cse4) (or (and .cse66 (forall ((v_ArrVal_1144 Int)) (let ((.cse361 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_62 Int) (v_y_32 Int)) (let ((.cse360 (+ (* v_y_62 4294967296) .cse8))) (or (< .cse360 (+ (* v_y_32 8589934592) 2 (* 2 .cse361))) (< 1 v_y_62) (< v_y_32 0) (< (+ 8589934590 (* v_y_32 4294967296) .cse361) .cse360)))) (< 4294967294 .cse361) (= .cse361 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse362 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (< 4294967294 .cse362) (forall ((v_y_62 Int) (v_y_32 Int)) (let ((.cse364 (* v_y_62 2147483648))) (let ((.cse365 (+ .cse364 2147483646)) (.cse363 (* v_y_32 4294967296))) (or (< (+ .cse363 .cse362 2147483646) (+ .cse364 .cse8)) (< .cse365 .cse362) (< 1 v_y_62) (< .cse365 (+ .cse363 .cse362)))))) (= .cse362 .cse8))))) .cse41) (forall ((v_ArrVal_1144 Int)) (let ((.cse372 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_107 Int)) (or (< 4294967295 v_z_107) (forall ((v_y_107 Int)) (let ((.cse374 (* v_y_107 4294967296)) (.cse375 (* 4294967295 v_z_107))) (let ((.cse366 (+ .cse374 .cse375))) (or (< 2147483647 .cse366) (< .cse366 0) (forall ((v_z_114 Int) (v_y_114 Int) (v_y_32 Int)) (let ((.cse368 (* v_z_114 2147483648)) (.cse369 (* v_y_114 4294967296)) (.cse376 (* v_y_32 4294967296))) (let ((.cse367 (+ .cse374 .cse375 .cse376 .cse372)) (.cse371 (+ .cse374 .cse375 .cse368 .cse369)) (.cse370 (+ .cse376 .cse372)) (.cse373 (+ .cse368 v_z_107))) (or (= .cse367 (+ .cse368 .cse369 .cse8)) (< v_z_114 0) (< .cse370 .cse371) (= (+ .cse368 .cse369 4294967296 .cse8) .cse367) (< .cse372 .cse371) (= .cse373 .cse8) (< .cse371 0) (< (+ .cse374 .cse375 .cse368 4294967295 .cse369) .cse370) (< 4294967295 .cse373))))))))) (< v_z_107 0))) (= .cse372 .cse8)))) (or .cse4 .cse377) .cse186 (or .cse359 .cse41) .cse187 (or .cse4 (and .cse66 (forall ((v_ArrVal_1144 Int)) (let ((.cse379 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_59 Int) (v_y_32 Int)) (let ((.cse378 (+ (* v_y_59 4294967296) .cse8))) (or (< .cse378 (+ (* v_y_32 8589934592) 2 (* 2 .cse379))) (< 1 v_y_59) (< (+ 8589934590 (* v_y_32 4294967296) .cse379) .cse378) (< v_y_32 0)))) (< 4294967294 .cse379) (= .cse379 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse382 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_59 Int) (v_y_32 Int)) (let ((.cse381 (* v_y_32 4294967296)) (.cse380 (* v_y_59 2147483648))) (or (< 1 v_y_59) (< v_y_32 0) (< (+ .cse380 2147483646) (+ .cse381 .cse382)) (< (+ .cse381 .cse382 2147483646) (+ .cse380 .cse8))))) (< 4294967294 .cse382) (= .cse382 .cse8)))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse385 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_66 Int)) (or (forall ((v_y_66 Int)) (let ((.cse388 (* v_z_66 4294967295)) (.cse389 (* v_y_66 4294967296))) (let ((.cse383 (+ .cse388 .cse389))) (or (< .cse383 0) (forall ((v_y_67 Int) (v_y_32 Int) (v_z_67 Int)) (let ((.cse391 (* v_z_67 2147483648)) (.cse392 (* v_y_67 4294967296))) (let ((.cse386 (+ .cse388 .cse391 .cse392 .cse389)) (.cse390 (+ .cse391 .cse392 .cse8)) (.cse384 (* v_y_32 4294967296)) (.cse387 (+ v_z_66 .cse391))) (or (< (+ .cse384 4294967296 .cse385) .cse386) (= .cse387 .cse44) (< .cse386 (+ .cse384 .cse385 1)) (< 1 v_z_67) (= (+ .cse388 .cse389 .cse384 .cse385) .cse390) (< .cse386 (+ .cse385 1)) (< 4294967295 .cse386) (= .cse390 (+ .cse388 .cse389 .cse384 4294967296 .cse385)) (= .cse387 .cse8) (< v_z_67 0))))) (< 2147483647 .cse383))))) (< v_z_66 0) (< 4294967295 v_z_66))) (= .cse385 .cse8)))) (forall ((v_ArrVal_1144 Int)) (let ((.cse393 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (= .cse393 .cse8) (forall ((v_z_44 Int)) (or (< v_z_44 0) (< 4294967295 v_z_44) (forall ((v_y_44 Int)) (let ((.cse397 (* v_y_44 4294967296)) (.cse399 (* v_z_44 4294967295))) (let ((.cse394 (+ .cse397 .cse399))) (or (< .cse394 0) (< 2147483647 .cse394) (forall ((v_z_47 Int) (v_y_47 Int) (v_y_32 Int)) (let ((.cse400 (* v_y_32 4294967296)) (.cse396 (* v_z_47 2147483648)) (.cse398 (* v_y_47 4294967296))) (let ((.cse395 (+ .cse397 .cse396 .cse398 .cse399)) (.cse401 (+ .cse397 .cse399 .cse400 .cse393))) (or (< 1 v_z_47) (< .cse395 0) (= (+ .cse396 v_z_44) .cse8) (< .cse393 .cse395) (< (+ .cse397 .cse396 .cse398 4294967295 .cse399) (+ .cse400 .cse393)) (< .cse401 (+ .cse396 .cse398 4294967296)) (< v_z_47 0) (= (+ .cse396 .cse398 4294967296 .cse8) .cse401)))))))))))))) (forall ((v_ArrVal_1144 Int)) (let ((.cse402 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (= .cse402 .cse8) (forall ((v_z_90 Int)) (or (< v_z_90 0) (< 4294967295 v_z_90) (forall ((v_y_90 Int)) (let ((.cse410 (* v_z_90 4294967295)) (.cse411 (* v_y_90 4294967296))) (let ((.cse403 (+ .cse410 .cse411))) (or (< .cse403 0) (forall ((v_z_94 Int) (v_y_94 Int) (v_y_32 Int)) (let ((.cse406 (* v_y_32 4294967296)) (.cse407 (* v_z_94 2147483648)) (.cse408 (* v_y_94 4294967296))) (let ((.cse404 (+ .cse407 .cse410 .cse411 .cse408)) (.cse409 (+ .cse410 .cse406 .cse411 .cse402)) (.cse405 (+ .cse407 v_z_90))) (or (< 4294967295 .cse404) (< 1 v_z_94) (< .cse405 4294967296) (< .cse404 (+ .cse402 1)) (< .cse404 (+ .cse406 .cse402 1)) (= (+ .cse407 .cse408 .cse8) .cse409) (< .cse409 (+ .cse407 .cse408)) (= .cse44 .cse405))))) (< 2147483647 .cse403)))))))))) (or .cse377 .cse41) (forall ((v_ArrVal_1144 Int)) (let ((.cse414 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_z_66 Int)) (or (< v_z_66 0) (< 4294967295 v_z_66) (forall ((v_y_66 Int)) (let ((.cse416 (* v_z_66 4294967295)) (.cse417 (* v_y_66 4294967296))) (let ((.cse412 (+ .cse416 .cse417))) (or (< .cse412 0) (< 2147483647 .cse412) (forall ((v_z_68 Int) (v_y_68 Int) (v_y_32 Int)) (let ((.cse420 (* v_z_68 2147483648)) (.cse421 (* v_y_68 4294967296))) (let ((.cse418 (+ .cse420 .cse8 .cse421)) (.cse419 (+ v_z_66 .cse420)) (.cse415 (+ .cse416 .cse420 .cse417 .cse421)) (.cse413 (* v_y_32 4294967296))) (or (< (+ .cse413 4294967296 .cse414) .cse415) (< .cse415 (+ .cse414 1)) (= (+ .cse416 .cse417 .cse413 .cse414) .cse418) (= .cse418 (+ .cse416 .cse417 .cse413 4294967296 .cse414)) (= .cse419 .cse44) (< 4294967295 .cse415) (< .cse419 4294967296) (< .cse415 (+ .cse413 .cse414 1)) (< 1 v_z_68))))))))))) (= .cse414 .cse8)))) (or .cse41 (and (forall ((v_ArrVal_1144 Int)) (let ((.cse424 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (or (forall ((v_y_138 Int) (v_y_32 Int)) (let ((.cse423 (* v_y_32 4294967296)) (.cse422 (* v_y_138 2147483648))) (or (< (+ .cse422 .cse8) (+ .cse423 .cse424 1)) (< (+ .cse423 .cse424) .cse422) (< v_y_138 0) (< .cse424 .cse422)))) (= .cse424 .cse8)))) (or (forall ((v_ArrVal_1144 Int) (v_y_138 Int) (v_y_32 Int)) (let ((.cse428 (* v_y_32 4294967296)) (.cse427 (mod (div (* (mod (select (select (store |c_#memory_int#4| c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.base (store .cse9 c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0.offset v_ArrVal_1144)) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.base) c_~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer~0.offset) 33554432) 128) .cse10) 4294967296))) (let ((.cse426 (+ .cse428 .cse427)) (.cse425 (* v_y_138 2147483648))) (or (< (+ 4294967295 .cse425) .cse426) (< .cse426 .cse425) (< (+ (* 2 .cse427) .cse428) (+ (* v_y_138 4294967296) .cse8 1)) (< v_y_138 0) (< .cse427 .cse425) (= .cse427 .cse8))))) .cse164)))))) .cse230) .cse231) .cse232) .cse1))) (or (let ((.cse442 (and (or .cse3 .cse440) .cse230))) (and (or .cse439 (and (or .cse3 .cse440 (forall ((v_z_24 Int) (v_y_24 Int)) (let ((.cse441 (+ (* v_z_24 4294967295) (* v_y_24 4294967296)))) (or (= .cse441 .cse8) (< .cse441 0) (< 4294967295 .cse441) (= v_z_24 .cse8) (< v_z_24 0) (< 4294967295 v_z_24))))) .cse230)) (or .cse442 .cse443) (or .cse440 .cse41) (or .cse444 .cse442) (or .cse4 .cse440))) .cse1 (and (or .cse445 .cse446) .cse439)) (or .cse447 .cse231 .cse448 (and (or .cse449 .cse3) (or .cse445 .cse440 .cse446)))))))))) is different from true [2023-12-21 02:01:17,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18225 treesize of output 16305 [2023-12-21 02:01:17,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15264 treesize of output 14388 [2023-12-21 02:02:39,889 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:41,255 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:02:42,127 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:42,624 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:02:43,401 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:02:46,135 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:02:47,028 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:02:47,752 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:49,071 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:49,815 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:02:50,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:51,688 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:52,555 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:02:53,505 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:02:54,820 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:55,470 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:56,401 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:02:56,908 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:02:58,571 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:00,888 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:04,185 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:04,186 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:04,200 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:04,771 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:04,772 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:04,787 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:05,338 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:05,338 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:05,353 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:06,757 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:06,757 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:06,769 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:10,135 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:10,136 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:10,150 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:10,956 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:10,957 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:10,973 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:13,297 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:13,297 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:13,310 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:14,450 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:14,450 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:14,464 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:15,708 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:15,709 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:15,723 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:16,491 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:16,491 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:16,503 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:17,624 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:17,625 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:17,637 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:18,424 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:18,424 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:18,436 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:20,848 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:20,848 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:20,860 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:21,551 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:21,551 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:21,565 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:22,140 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:22,141 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:22,152 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:22,758 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:22,759 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:22,775 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:23,947 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:23,947 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:23,959 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:25,292 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:25,293 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:25,308 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:26,054 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:26,055 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:26,070 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:27,469 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:27,469 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:27,485 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:30,311 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:30,312 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:30,329 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:30,329 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:30,344 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:31,393 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:31,394 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:31,410 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:31,411 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:31,426 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:32,496 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:32,497 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:32,506 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:32,506 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:32,522 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:33,141 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:33,141 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:33,156 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:33,156 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:33,167 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,301 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,301 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,311 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,312 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,325 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,897 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,897 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,910 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,911 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:40,927 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:44,027 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,028 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,045 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,045 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,064 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,883 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,884 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,899 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,899 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:44,913 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:45,801 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:45,802 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:45,824 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:45,824 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:45,841 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:47,131 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:47,132 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:47,148 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:47,148 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:47,166 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:48,011 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:48,011 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:48,026 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:48,026 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:48,041 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:50,294 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:50,295 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:50,305 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:50,305 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:50,317 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-21 02:03:51,540 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:51,540 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:51,552 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:51,552 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:51,569 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:52,238 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:52,238 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:52,247 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:52,248 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:52,258 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:52,824 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:52,824 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:52,837 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:52,837 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:52,849 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:54,063 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:54,063 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:54,081 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:54,081 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:54,094 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:54,927 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:54,927 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:54,941 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:54,941 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:54,953 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:55,601 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:55,601 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:55,616 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:55,616 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:55,627 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-21 02:03:57,057 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,057 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,070 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,070 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,087 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,829 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,829 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,840 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,841 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:03:57,853 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:04,694 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:08,583 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:08,584 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:08,638 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:14,941 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:14,942 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:24,728 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:25,452 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:26,211 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:27,037 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:27,038 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:27,044 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:27,913 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:27,913 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:27,922 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:31,910 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:31,911 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:31,920 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:53,993 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:53,993 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:54,003 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:54,003 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:54,013 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:56,326 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:56,326 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:56,337 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:56,337 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:05:56,347 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:01,983 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:01,983 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:01,999 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:01,999 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:02,005 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,316 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,316 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,324 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,324 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,335 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,335 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:11,344 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,758 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,758 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,772 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,772 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,783 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,783 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:16,792 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,084 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,084 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,092 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,092 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,103 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,103 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-21 02:06:20,109 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. Received shutdown request... [2023-12-21 02:06:42,883 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 02:06:42,883 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 02:06:43,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 02:06:44,083 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 02:06:44,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-21 02:06:44,194 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:06:44,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-21 02:06:44,194 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 140 with TraceHistMax 17,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-21 02:06:44,197 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:06:44,199 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:06:44,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:06:44 BoogieIcfgContainer [2023-12-21 02:06:44,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:06:44,200 INFO L158 Benchmark]: Toolchain (without parser) took 850480.81ms. Allocated memory was 191.9MB in the beginning and 723.5MB in the end (delta: 531.6MB). Free memory was 144.3MB in the beginning and 478.0MB in the end (delta: -333.7MB). Peak memory consumption was 431.7MB. Max. memory is 8.0GB. [2023-12-21 02:06:44,200 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:06:44,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.46ms. Allocated memory is still 191.9MB. Free memory was 144.0MB in the beginning and 129.6MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 02:06:44,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.15ms. Allocated memory is still 191.9MB. Free memory was 129.6MB in the beginning and 126.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:06:44,202 INFO L158 Benchmark]: Boogie Preprocessor took 62.48ms. Allocated memory is still 191.9MB. Free memory was 126.1MB in the beginning and 122.4MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:06:44,202 INFO L158 Benchmark]: RCFGBuilder took 561.95ms. Allocated memory was 191.9MB in the beginning and 255.9MB in the end (delta: 64.0MB). Free memory was 122.4MB in the beginning and 214.0MB in the end (delta: -91.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-21 02:06:44,202 INFO L158 Benchmark]: TraceAbstraction took 849559.55ms. Allocated memory was 255.9MB in the beginning and 723.5MB in the end (delta: 467.7MB). Free memory was 213.4MB in the beginning and 478.0MB in the end (delta: -264.6MB). Peak memory consumption was 435.9MB. Max. memory is 8.0GB. [2023-12-21 02:06:44,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.46ms. Allocated memory is still 191.9MB. Free memory was 144.0MB in the beginning and 129.6MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.15ms. Allocated memory is still 191.9MB. Free memory was 129.6MB in the beginning and 126.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.48ms. Allocated memory is still 191.9MB. Free memory was 126.1MB in the beginning and 122.4MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 561.95ms. Allocated memory was 191.9MB in the beginning and 255.9MB in the end (delta: 64.0MB). Free memory was 122.4MB in the beginning and 214.0MB in the end (delta: -91.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 849559.55ms. Allocated memory was 255.9MB in the beginning and 723.5MB in the end (delta: 467.7MB). Free memory was 213.4MB in the beginning and 478.0MB in the end (delta: -264.6MB). Peak memory consumption was 435.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 140 with TraceHistMax 17,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 849.5s, OverallIterations: 35, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 56.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 7087 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7052 mSDsluCounter, 18898 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 253 IncrementalHoareTripleChecker+Unchecked, 14616 mSDsCounter, 732 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11843 IncrementalHoareTripleChecker+Invalid, 12834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 732 mSolverCounterUnsat, 4282 mSDtfsCounter, 11843 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3254 GetRequests, 2784 SyntacticMatches, 0 SemanticMatches, 470 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1913 ImplicationChecksByTransitivity, 37.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=949occurred in iteration=28, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 2787 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 34.3s InterpolantComputationTime, 4508 NumberOfCodeBlocks, 4508 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4879 ConstructedInterpolants, 45 QuantifiedInterpolants, 46781 SizeOfPredicates, 153 NumberOfNonLiveVariables, 5334 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 37 InterpolantComputations, 32 PerfectInterpolantSequences, 19412/20128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown