/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:19:58,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:19:58,941 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-19 15:19:58,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:19:58,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:19:58,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:19:58,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:19:58,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:19:58,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:19:58,977 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:19:58,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:19:58,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:19:58,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:19:58,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:19:58,980 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:19:58,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:19:58,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:19:58,981 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:19:58,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:19:58,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:19:58,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:19:58,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:19:58,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:19:58,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:19:58,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:19:58,984 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:19:58,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:19:58,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:19:58,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:19:58,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:19:58,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:19:58,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:19:58,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:19:58,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:19:58,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:19:58,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:19:58,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:19:58,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:19:58,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:19:58,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:19:58,988 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:19:58,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:19:58,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:19:58,988 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 -> true [2023-12-19 15:19:59,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:19:59,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:19:59,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:19:59,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:19:59,246 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:19:59,247 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-5.i [2023-12-19 15:20:00,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:20:00,599 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:20:00,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i [2023-12-19 15:20:00,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12e83fcf/7df6050e29f84e989024f0d0429928d0/FLAGa90771522 [2023-12-19 15:20:00,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12e83fcf/7df6050e29f84e989024f0d0429928d0 [2023-12-19 15:20:00,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:20:00,621 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:20:00,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:20:00,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:20:00,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:20:00,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:00,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25dcfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00, skipping insertion in model container [2023-12-19 15:20:00,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:00,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:20:00,795 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-5.i[916,929] [2023-12-19 15:20:00,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:20:00,868 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:20:00,878 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-5.i[916,929] [2023-12-19 15:20:00,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:20:00,920 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:20:00,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00 WrapperNode [2023-12-19 15:20:00,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:20:00,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:20:00,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:20:00,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:20:00,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:00,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:00,997 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2023-12-19 15:20:00,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:20:00,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:20:00,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:20:00,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:20:01,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,042 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 3, 28, 59, 24]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 6, 4, 3]. The 17 writes are split as follows [0, 1, 1, 6, 6, 3]. [2023-12-19 15:20:01,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:20:01,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:20:01,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:20:01,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:20:01,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (1/1) ... [2023-12-19 15:20:01,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:20:01,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:01,137 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-19 15:20:01,163 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-19 15:20:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:20:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:20:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:20:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:20:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:20:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:20:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:20:01,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:20:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:20:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:20:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:20:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:20:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:20:01,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:20:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:20:01,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:20:01,281 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:20:01,283 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:20:01,672 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:20:01,718 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:20:01,718 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:20:01,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:20:01 BoogieIcfgContainer [2023-12-19 15:20:01,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:20:01,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:20:01,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:20:01,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:20:01,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:20:00" (1/3) ... [2023-12-19 15:20:01,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa35007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:20:01, skipping insertion in model container [2023-12-19 15:20:01,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:20:00" (2/3) ... [2023-12-19 15:20:01,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa35007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:20:01, skipping insertion in model container [2023-12-19 15:20:01,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:20:01" (3/3) ... [2023-12-19 15:20:01,725 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-5.i [2023-12-19 15:20:01,739 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:20:01,740 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:20:01,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:20:01,787 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;@45feeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:20:01,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:20:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:20:01,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:01,806 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:01,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:01,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1626294328, now seen corresponding path program 1 times [2023-12-19 15:20:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:01,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302477233] [2023-12-19 15:20:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302477233] [2023-12-19 15:20:02,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 15:20:02,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970536864] [2023-12-19 15:20:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:02,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:02,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:02,076 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-19 15:20:02,100 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-19 15:20:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:02,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-19 15:20:02,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2023-12-19 15:20:02,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970536864] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:20:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254460373] [2023-12-19 15:20:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:02,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:20:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:02,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:20:02,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:20:02,431 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:20:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:02,476 INFO L93 Difference]: Finished difference Result 173 states and 276 transitions. [2023-12-19 15:20:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:20:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2023-12-19 15:20:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:02,483 INFO L225 Difference]: With dead ends: 173 [2023-12-19 15:20:02,483 INFO L226 Difference]: Without dead ends: 86 [2023-12-19 15:20:02,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-19 15:20:02,488 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:02,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-19 15:20:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-19 15:20:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-12-19 15:20:02,529 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 142 [2023-12-19 15:20:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:02,530 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-12-19 15:20:02,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:20:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-12-19 15:20:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:20:02,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:02,534 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:02,544 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-19 15:20:02,745 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,SelfDestructingSolverStorable0 [2023-12-19 15:20:02,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:02,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1696479216, now seen corresponding path program 1 times [2023-12-19 15:20:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876642859] [2023-12-19 15:20:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:02,846 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650856652] [2023-12-19 15:20:02,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:02,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:02,854 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-19 15:20:02,861 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-19 15:20:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:03,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:20:03,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:03,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:03,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:03,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876642859] [2023-12-19 15:20:03,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:03,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650856652] [2023-12-19 15:20:03,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650856652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:03,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:03,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:20:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345250038] [2023-12-19 15:20:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:03,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:20:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:20:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:20:03,157 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:03,239 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2023-12-19 15:20:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:20:03,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-19 15:20:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:03,245 INFO L225 Difference]: With dead ends: 183 [2023-12-19 15:20:03,245 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 15:20:03,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:03,247 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:03,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 350 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 15:20:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2023-12-19 15:20:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2023-12-19 15:20:03,275 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 142 [2023-12-19 15:20:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:03,277 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2023-12-19 15:20:03,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2023-12-19 15:20:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:20:03,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:03,280 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:03,292 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-19 15:20:03,488 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,SelfDestructingSolverStorable1 [2023-12-19 15:20:03,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:03,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1789141454, now seen corresponding path program 1 times [2023-12-19 15:20:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585413249] [2023-12-19 15:20:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:03,564 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:03,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478057627] [2023-12-19 15:20:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:03,566 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-19 15:20:03,585 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-19 15:20:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:03,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:20:03,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:03,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585413249] [2023-12-19 15:20:03,783 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478057627] [2023-12-19 15:20:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478057627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:03,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:20:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266384964] [2023-12-19 15:20:03,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:03,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:20:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:03,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:20:03,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:20:03,786 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:03,845 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2023-12-19 15:20:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:20:03,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-19 15:20:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:03,849 INFO L225 Difference]: With dead ends: 183 [2023-12-19 15:20:03,849 INFO L226 Difference]: Without dead ends: 96 [2023-12-19 15:20:03,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:03,850 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 12 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:03,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 348 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-19 15:20:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2023-12-19 15:20:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2023-12-19 15:20:03,859 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 142 [2023-12-19 15:20:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:03,864 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2023-12-19 15:20:03,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2023-12-19 15:20:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:20:03,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:03,867 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:03,874 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-19 15:20:04,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:04,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:04,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1846399756, now seen corresponding path program 1 times [2023-12-19 15:20:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826488490] [2023-12-19 15:20:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:04,114 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418411834] [2023-12-19 15:20:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:04,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:04,117 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-19 15:20:04,120 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-19 15:20:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:04,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:20:04,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:04,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:04,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826488490] [2023-12-19 15:20:04,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418411834] [2023-12-19 15:20:04,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418411834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:20:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512089999] [2023-12-19 15:20:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:04,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:20:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:20:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:20:04,313 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:04,361 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2023-12-19 15:20:04,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:20:04,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-19 15:20:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:04,367 INFO L225 Difference]: With dead ends: 183 [2023-12-19 15:20:04,367 INFO L226 Difference]: Without dead ends: 94 [2023-12-19 15:20:04,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:04,369 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:04,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 348 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-19 15:20:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-12-19 15:20:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2023-12-19 15:20:04,380 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 142 [2023-12-19 15:20:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:04,380 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2023-12-19 15:20:04,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2023-12-19 15:20:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:20:04,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:04,382 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:04,394 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-19 15:20:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:04,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:04,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1846459338, now seen corresponding path program 1 times [2023-12-19 15:20:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543426902] [2023-12-19 15:20:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:04,621 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340031156] [2023-12-19 15:20:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:04,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:04,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:04,626 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-19 15:20:04,628 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-19 15:20:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:04,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:20:04,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:04,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543426902] [2023-12-19 15:20:04,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340031156] [2023-12-19 15:20:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340031156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:04,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:20:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080858426] [2023-12-19 15:20:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:04,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:20:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:20:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:20:04,845 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:04,879 INFO L93 Difference]: Finished difference Result 210 states and 296 transitions. [2023-12-19 15:20:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:20:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-19 15:20:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:04,880 INFO L225 Difference]: With dead ends: 210 [2023-12-19 15:20:04,880 INFO L226 Difference]: Without dead ends: 119 [2023-12-19 15:20:04,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:04,882 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:04,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-19 15:20:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2023-12-19 15:20:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2023-12-19 15:20:04,889 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 142 [2023-12-19 15:20:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:04,890 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2023-12-19 15:20:04,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2023-12-19 15:20:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 15:20:04,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:04,892 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:04,901 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-19 15:20:05,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:05,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:05,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -331266065, now seen corresponding path program 1 times [2023-12-19 15:20:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854951604] [2023-12-19 15:20:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:05,128 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599238018] [2023-12-19 15:20:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:05,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:05,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:05,129 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-19 15:20:05,148 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-19 15:20:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:05,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 15:20:05,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:05,344 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-19 15:20:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:05,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854951604] [2023-12-19 15:20:05,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:05,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599238018] [2023-12-19 15:20:05,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599238018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:05,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590630318] [2023-12-19 15:20:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:05,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:05,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:05,353 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:05,370 INFO L93 Difference]: Finished difference Result 212 states and 297 transitions. [2023-12-19 15:20:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-19 15:20:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:05,372 INFO L225 Difference]: With dead ends: 212 [2023-12-19 15:20:05,372 INFO L226 Difference]: Without dead ends: 119 [2023-12-19 15:20:05,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:05,373 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:05,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-19 15:20:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2023-12-19 15:20:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2023-12-19 15:20:05,380 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 144 [2023-12-19 15:20:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:05,381 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2023-12-19 15:20:05,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2023-12-19 15:20:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 15:20:05,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:05,382 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:05,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:05,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:05,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:05,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1611129743, now seen corresponding path program 1 times [2023-12-19 15:20:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101311774] [2023-12-19 15:20:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:05,628 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623439257] [2023-12-19 15:20:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:05,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:05,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:05,631 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-19 15:20:05,648 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-19 15:20:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:05,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 15:20:05,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:05,834 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-19 15:20:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:05,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101311774] [2023-12-19 15:20:05,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623439257] [2023-12-19 15:20:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623439257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:05,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976414401] [2023-12-19 15:20:05,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:05,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:05,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:05,852 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:05,875 INFO L93 Difference]: Finished difference Result 187 states and 261 transitions. [2023-12-19 15:20:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:05,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-19 15:20:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:05,879 INFO L225 Difference]: With dead ends: 187 [2023-12-19 15:20:05,880 INFO L226 Difference]: Without dead ends: 94 [2023-12-19 15:20:05,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:05,883 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:05,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-19 15:20:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-19 15:20:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2023-12-19 15:20:05,903 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 144 [2023-12-19 15:20:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:05,904 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2023-12-19 15:20:05,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2023-12-19 15:20:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:05,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:05,905 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:05,919 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-19 15:20:06,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:06,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:06,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1662697046, now seen corresponding path program 1 times [2023-12-19 15:20:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848276223] [2023-12-19 15:20:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:06,140 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141924947] [2023-12-19 15:20:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:06,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:06,142 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-19 15:20:06,145 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-19 15:20:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:06,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 15:20:06,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:06,337 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-19 15:20:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:06,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:06,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848276223] [2023-12-19 15:20:06,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141924947] [2023-12-19 15:20:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141924947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:06,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:06,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611701815] [2023-12-19 15:20:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:06,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:06,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:06,344 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:06,375 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2023-12-19 15:20:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-19 15:20:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:06,377 INFO L225 Difference]: With dead ends: 187 [2023-12-19 15:20:06,377 INFO L226 Difference]: Without dead ends: 94 [2023-12-19 15:20:06,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:06,378 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:06,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 228 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-19 15:20:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-19 15:20:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:20:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2023-12-19 15:20:06,389 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 146 [2023-12-19 15:20:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:06,389 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2023-12-19 15:20:06,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2023-12-19 15:20:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:06,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:06,391 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:06,400 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-19 15:20:06,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-19 15:20:06,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:06,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash -26246696, now seen corresponding path program 1 times [2023-12-19 15:20:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341565134] [2023-12-19 15:20:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:06,628 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944463070] [2023-12-19 15:20:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:06,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:06,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:06,630 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-19 15:20:06,653 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-19 15:20:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:06,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-19 15:20:06,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:08,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 15:20:08,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:08,158 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-19 15:20:08,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:08,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:08,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-19 15:20:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 15:20:08,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:08,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:20:08,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1083 treesize of output 1061 [2023-12-19 15:20:08,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-12-19 15:20:08,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-12-19 15:20:09,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:09,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,046 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 15:20:09,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,127 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-12-19 15:20:09,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-19 15:20:09,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-19 15:20:09,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 15:20:09,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-19 15:20:09,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2023-12-19 15:20:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341565134] [2023-12-19 15:20:09,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944463070] [2023-12-19 15:20:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944463070] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2023-12-19 15:20:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127529274] [2023-12-19 15:20:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:09,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:20:09,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:20:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-12-19 15:20:09,673 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:10,118 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2023-12-19 15:20:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:20:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-19 15:20:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:10,119 INFO L225 Difference]: With dead ends: 221 [2023-12-19 15:20:10,119 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 15:20:10,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2023-12-19 15:20:10,120 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 221 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:10,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 702 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:20:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 15:20:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2023-12-19 15:20:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 76 states have internal predecessors, (91), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:20:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2023-12-19 15:20:10,128 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 146 [2023-12-19 15:20:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:10,129 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2023-12-19 15:20:10,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2023-12-19 15:20:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:20:10,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:10,130 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:10,142 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-19 15:20:10,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:10,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:10,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1532718106, now seen corresponding path program 1 times [2023-12-19 15:20:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087865686] [2023-12-19 15:20:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:10,374 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:10,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543601552] [2023-12-19 15:20:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:10,384 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-19 15:20:10,393 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-19 15:20:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:10,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-19 15:20:10,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:10,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087865686] [2023-12-19 15:20:10,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543601552] [2023-12-19 15:20:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543601552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248312056] [2023-12-19 15:20:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:10,603 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:10,650 INFO L93 Difference]: Finished difference Result 213 states and 287 transitions. [2023-12-19 15:20:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-19 15:20:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:10,652 INFO L225 Difference]: With dead ends: 213 [2023-12-19 15:20:10,653 INFO L226 Difference]: Without dead ends: 118 [2023-12-19 15:20:10,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:20:10,654 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 54 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:10,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 442 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-19 15:20:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2023-12-19 15:20:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.205128205128205) internal successors, (94), 79 states have internal predecessors, (94), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:20:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2023-12-19 15:20:10,664 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 146 [2023-12-19 15:20:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:10,665 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2023-12-19 15:20:10,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2023-12-19 15:20:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:10,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:10,667 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:10,674 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-19 15:20:10,874 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,SelfDestructingSolverStorable9 [2023-12-19 15:20:10,875 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:10,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1280630248, now seen corresponding path program 1 times [2023-12-19 15:20:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147659073] [2023-12-19 15:20:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:10,906 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:10,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51508615] [2023-12-19 15:20:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:10,911 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-19 15:20:10,916 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-19 15:20:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:11,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 15:20:11,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:11,118 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-19 15:20:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:11,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147659073] [2023-12-19 15:20:11,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51508615] [2023-12-19 15:20:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51508615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704798403] [2023-12-19 15:20:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:11,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:11,129 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:11,168 INFO L93 Difference]: Finished difference Result 254 states and 336 transitions. [2023-12-19 15:20:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-19 15:20:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:11,169 INFO L225 Difference]: With dead ends: 254 [2023-12-19 15:20:11,169 INFO L226 Difference]: Without dead ends: 156 [2023-12-19 15:20:11,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 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-19 15:20:11,170 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:11,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 448 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-19 15:20:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2023-12-19 15:20:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 94 states have internal predecessors, (112), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:20:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2023-12-19 15:20:11,177 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 148 [2023-12-19 15:20:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:11,177 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2023-12-19 15:20:11,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2023-12-19 15:20:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:20:11,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:11,179 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:11,185 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-19 15:20:11,385 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,SelfDestructingSolverStorable10 [2023-12-19 15:20:11,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:11,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1143921882, now seen corresponding path program 1 times [2023-12-19 15:20:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440242471] [2023-12-19 15:20:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:11,411 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040628013] [2023-12-19 15:20:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:11,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:11,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:11,415 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-19 15:20:11,431 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-19 15:20:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:11,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 15:20:11,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:11,619 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-19 15:20:11,622 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-19 15:20:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:11,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440242471] [2023-12-19 15:20:11,628 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040628013] [2023-12-19 15:20:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040628013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:20:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828108417] [2023-12-19 15:20:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:11,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:20:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:20:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:11,629 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:11,645 INFO L93 Difference]: Finished difference Result 231 states and 305 transitions. [2023-12-19 15:20:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:20:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-19 15:20:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:11,647 INFO L225 Difference]: With dead ends: 231 [2023-12-19 15:20:11,647 INFO L226 Difference]: Without dead ends: 118 [2023-12-19 15:20:11,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:20:11,647 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:11,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 195 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-19 15:20:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-19 15:20:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 94 states have internal predecessors, (110), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:20:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2023-12-19 15:20:11,654 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 148 [2023-12-19 15:20:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:11,655 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2023-12-19 15:20:11,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2023-12-19 15:20:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:20:11,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:11,656 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:11,666 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-19 15:20:11,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-19 15:20:11,863 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:11,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash -313637823, now seen corresponding path program 1 times [2023-12-19 15:20:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255575995] [2023-12-19 15:20:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:11,894 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:11,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223477716] [2023-12-19 15:20:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:11,898 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:11,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 15:20:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:12,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-19 15:20:12,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:12,128 INFO L349 Elim1Store]: treesize reduction 38, result has 33.3 percent of original size [2023-12-19 15:20:12,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2023-12-19 15:20:12,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-12-19 15:20:12,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-12-19 15:20:12,162 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 0 case distinctions, treesize of input 37 treesize of output 18 [2023-12-19 15:20:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:12,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255575995] [2023-12-19 15:20:12,248 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223477716] [2023-12-19 15:20:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223477716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:20:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094260345] [2023-12-19 15:20:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:20:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:20:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:20:12,250 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:12,437 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2023-12-19 15:20:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:20:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-19 15:20:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:12,439 INFO L225 Difference]: With dead ends: 140 [2023-12-19 15:20:12,439 INFO L226 Difference]: Without dead ends: 138 [2023-12-19 15:20:12,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:12,439 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 100 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:12,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 439 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:20:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-19 15:20:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2023-12-19 15:20:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 96 states have internal predecessors, (112), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:20:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2023-12-19 15:20:12,447 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 150 [2023-12-19 15:20:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:12,448 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2023-12-19 15:20:12,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2023-12-19 15:20:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:20:12,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:12,449 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:12,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:12,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 15:20:12,656 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:12,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash -313578241, now seen corresponding path program 1 times [2023-12-19 15:20:12,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:12,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486574242] [2023-12-19 15:20:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:12,681 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:12,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448443646] [2023-12-19 15:20:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:12,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:12,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:12,682 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:12,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-19 15:20:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:12,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-19 15:20:12,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:13,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2023-12-19 15:20:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:13,573 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:13,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:13,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486574242] [2023-12-19 15:20:13,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:13,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448443646] [2023-12-19 15:20:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448443646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:13,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059167773] [2023-12-19 15:20:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:13,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:20:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:13,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:20:13,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:20:13,575 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:13,769 INFO L93 Difference]: Finished difference Result 236 states and 306 transitions. [2023-12-19 15:20:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-19 15:20:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:13,770 INFO L225 Difference]: With dead ends: 236 [2023-12-19 15:20:13,770 INFO L226 Difference]: Without dead ends: 121 [2023-12-19 15:20:13,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 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-19 15:20:13,771 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 81 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:13,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 341 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:20:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-19 15:20:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2023-12-19 15:20:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.168421052631579) internal successors, (111), 96 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:20:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2023-12-19 15:20:13,780 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 150 [2023-12-19 15:20:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:13,780 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2023-12-19 15:20:13,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2023-12-19 15:20:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:20:13,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:13,782 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:13,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-19 15:20:13,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:13,988 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:13,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -256319939, now seen corresponding path program 1 times [2023-12-19 15:20:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:13,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125404832] [2023-12-19 15:20:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:14,021 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807537469] [2023-12-19 15:20:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:14,023 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:14,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-19 15:20:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:14,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 15:20:14,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:14,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-19 15:20:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:14,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125404832] [2023-12-19 15:20:14,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807537469] [2023-12-19 15:20:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807537469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059335081] [2023-12-19 15:20:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:14,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:14,257 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:14,317 INFO L93 Difference]: Finished difference Result 297 states and 389 transitions. [2023-12-19 15:20:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:20:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-19 15:20:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:14,319 INFO L225 Difference]: With dead ends: 297 [2023-12-19 15:20:14,319 INFO L226 Difference]: Without dead ends: 182 [2023-12-19 15:20:14,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:20:14,320 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 112 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:14,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 640 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-19 15:20:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 160. [2023-12-19 15:20:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.1293103448275863) internal successors, (131), 117 states have internal predecessors, (131), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:20:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2023-12-19 15:20:14,334 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 150 [2023-12-19 15:20:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:14,335 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2023-12-19 15:20:14,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2023-12-19 15:20:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:20:14,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:14,336 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:14,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:14,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-19 15:20:14,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:14,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1065666565, now seen corresponding path program 1 times [2023-12-19 15:20:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:14,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722313133] [2023-12-19 15:20:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:14,567 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103247679] [2023-12-19 15:20:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:14,568 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:14,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-19 15:20:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:14,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-19 15:20:14,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:14,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:14,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722313133] [2023-12-19 15:20:14,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103247679] [2023-12-19 15:20:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103247679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696800108] [2023-12-19 15:20:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:14,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:14,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:14,780 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:14,825 INFO L93 Difference]: Finished difference Result 283 states and 367 transitions. [2023-12-19 15:20:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:20:14,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-19 15:20:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:14,827 INFO L225 Difference]: With dead ends: 283 [2023-12-19 15:20:14,827 INFO L226 Difference]: Without dead ends: 168 [2023-12-19 15:20:14,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:20:14,828 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 18 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:14,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 435 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:20:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-19 15:20:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2023-12-19 15:20:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.1260504201680672) internal successors, (134), 120 states have internal predecessors, (134), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:20:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 214 transitions. [2023-12-19 15:20:14,841 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 214 transitions. Word has length 150 [2023-12-19 15:20:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:14,842 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 214 transitions. [2023-12-19 15:20:14,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2023-12-19 15:20:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 15:20:14,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:14,843 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:14,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:15,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-19 15:20:15,056 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:15,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash -308746224, now seen corresponding path program 1 times [2023-12-19 15:20:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185178410] [2023-12-19 15:20:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:15,085 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660257429] [2023-12-19 15:20:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:15,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:15,087 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:15,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-19 15:20:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:15,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-19 15:20:15,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:15,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:15,697 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 15 treesize of output 15 [2023-12-19 15:20:15,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:15,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:20:15,782 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 1 case distinctions, treesize of input 52 treesize of output 28 [2023-12-19 15:20:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 15:20:15,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185178410] [2023-12-19 15:20:15,904 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660257429] [2023-12-19 15:20:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660257429] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2023-12-19 15:20:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697492721] [2023-12-19 15:20:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:15,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:20:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:20:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:15,905 INFO L87 Difference]: Start difference. First operand 163 states and 214 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:16,166 INFO L93 Difference]: Finished difference Result 375 states and 474 transitions. [2023-12-19 15:20:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:20:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2023-12-19 15:20:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:16,168 INFO L225 Difference]: With dead ends: 375 [2023-12-19 15:20:16,168 INFO L226 Difference]: Without dead ends: 257 [2023-12-19 15:20:16,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:20:16,169 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 153 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:16,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 838 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:20:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-19 15:20:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 213. [2023-12-19 15:20:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 159 states have (on average 1.119496855345912) internal successors, (178), 161 states have internal predecessors, (178), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:20:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2023-12-19 15:20:16,186 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 151 [2023-12-19 15:20:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:16,187 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2023-12-19 15:20:16,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2023-12-19 15:20:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 15:20:16,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:16,188 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:16,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:16,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-19 15:20:16,395 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:16,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1229082198, now seen corresponding path program 1 times [2023-12-19 15:20:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:16,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134370331] [2023-12-19 15:20:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:16,416 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440201849] [2023-12-19 15:20:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:16,418 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:16,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-19 15:20:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:16,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-19 15:20:16,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:16,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:20:16,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 104 [2023-12-19 15:20:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:16,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:20:16,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:16,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134370331] [2023-12-19 15:20:16,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:16,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440201849] [2023-12-19 15:20:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440201849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:20:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:20:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:20:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732142448] [2023-12-19 15:20:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:16,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:20:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:20:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:20:16,910 INFO L87 Difference]: Start difference. First operand 213 states and 274 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:17,183 INFO L93 Difference]: Finished difference Result 512 states and 632 transitions. [2023-12-19 15:20:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:20:17,188 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-12-19 15:20:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:17,190 INFO L225 Difference]: With dead ends: 512 [2023-12-19 15:20:17,190 INFO L226 Difference]: Without dead ends: 344 [2023-12-19 15:20:17,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:20:17,192 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 71 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:17,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 358 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:20:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-12-19 15:20:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 251. [2023-12-19 15:20:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 196 states have (on average 1.1173469387755102) internal successors, (219), 198 states have internal predecessors, (219), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:20:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 315 transitions. [2023-12-19 15:20:17,218 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 315 transitions. Word has length 152 [2023-12-19 15:20:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:17,218 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 315 transitions. [2023-12-19 15:20:17,219 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 315 transitions. [2023-12-19 15:20:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-19 15:20:17,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:17,220 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:17,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:17,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-19 15:20:17,427 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:17,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1378220619, now seen corresponding path program 1 times [2023-12-19 15:20:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:17,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018661689] [2023-12-19 15:20:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:17,454 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449156647] [2023-12-19 15:20:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:17,456 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:17,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-19 15:20:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:17,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-19 15:20:17,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:18,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:18,099 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 15 treesize of output 15 [2023-12-19 15:20:18,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:20:18,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:20:18,202 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 1 case distinctions, treesize of input 52 treesize of output 28 [2023-12-19 15:20:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 15:20:18,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:20:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018661689] [2023-12-19 15:20:18,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449156647] [2023-12-19 15:20:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449156647] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2023-12-19 15:20:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540472089] [2023-12-19 15:20:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:20:18,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:20:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:20:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:20:18,361 INFO L87 Difference]: Start difference. First operand 251 states and 315 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:18,723 INFO L93 Difference]: Finished difference Result 538 states and 659 transitions. [2023-12-19 15:20:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:20:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-12-19 15:20:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:18,726 INFO L225 Difference]: With dead ends: 538 [2023-12-19 15:20:18,726 INFO L226 Difference]: Without dead ends: 336 [2023-12-19 15:20:18,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2023-12-19 15:20:18,727 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 148 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:18,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 982 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:20:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-12-19 15:20:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 241. [2023-12-19 15:20:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 186 states have (on average 1.1129032258064515) internal successors, (207), 188 states have internal predecessors, (207), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:20:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 303 transitions. [2023-12-19 15:20:18,754 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 303 transitions. Word has length 153 [2023-12-19 15:20:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:18,754 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 303 transitions. [2023-12-19 15:20:18,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:20:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 303 transitions. [2023-12-19 15:20:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-19 15:20:18,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:18,756 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:18,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:18,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:18,962 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:18,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash 988748987, now seen corresponding path program 1 times [2023-12-19 15:20:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:18,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617830498] [2023-12-19 15:20:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:18,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:18,991 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505320339] [2023-12-19 15:20:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:18,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:18,993 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:19,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-19 15:20:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:19,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-19 15:20:19,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:20,788 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-19 15:20:21,142 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-19 15:20:21,681 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-19 15:20:22,313 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-19 15:20:22,812 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 13 [2023-12-19 15:20:23,622 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 70 treesize of output 59 [2023-12-19 15:20:24,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:20:24,384 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 3 case distinctions, treesize of input 75 treesize of output 43 [2023-12-19 15:20:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 20 proven. 319 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-12-19 15:20:24,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617830498] [2023-12-19 15:20:26,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505320339] [2023-12-19 15:20:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505320339] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:26,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2023-12-19 15:20:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338216792] [2023-12-19 15:20:26,828 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:20:26,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 15:20:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 15:20:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2023-12-19 15:20:26,830 INFO L87 Difference]: Start difference. First operand 241 states and 303 transitions. Second operand has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-19 15:20:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:32,112 INFO L93 Difference]: Finished difference Result 721 states and 868 transitions. [2023-12-19 15:20:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-19 15:20:32,112 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 154 [2023-12-19 15:20:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:32,115 INFO L225 Difference]: With dead ends: 721 [2023-12-19 15:20:32,115 INFO L226 Difference]: Without dead ends: 529 [2023-12-19 15:20:32,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1191, Invalid=5615, Unknown=0, NotChecked=0, Total=6806 [2023-12-19 15:20:32,117 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 346 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:32,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1186 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-19 15:20:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-12-19 15:20:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 476. [2023-12-19 15:20:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 368 states have (on average 1.0869565217391304) internal successors, (400), 372 states have internal predecessors, (400), 89 states have call successors, (89), 18 states have call predecessors, (89), 18 states have return successors, (89), 85 states have call predecessors, (89), 89 states have call successors, (89) [2023-12-19 15:20:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 578 transitions. [2023-12-19 15:20:32,172 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 578 transitions. Word has length 154 [2023-12-19 15:20:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:32,173 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 578 transitions. [2023-12-19 15:20:32,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-19 15:20:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 578 transitions. [2023-12-19 15:20:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-19 15:20:32,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:32,174 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:32,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:32,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:32,383 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:32,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1246914425, now seen corresponding path program 1 times [2023-12-19 15:20:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048813333] [2023-12-19 15:20:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:32,409 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483993693] [2023-12-19 15:20:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:32,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:32,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:32,410 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:32,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-19 15:20:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:32,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-19 15:20:32,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:33,760 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-19 15:20:33,909 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-19 15:20:34,087 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 33 treesize of output 24 [2023-12-19 15:20:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:34,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:34,277 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 53 treesize of output 45 [2023-12-19 15:20:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048813333] [2023-12-19 15:20:34,521 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483993693] [2023-12-19 15:20:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483993693] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:34,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-12-19 15:20:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657077593] [2023-12-19 15:20:34,521 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:20:34,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:20:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:20:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:34,522 INFO L87 Difference]: Start difference. First operand 476 states and 578 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:20:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:34,996 INFO L93 Difference]: Finished difference Result 1055 states and 1274 transitions. [2023-12-19 15:20:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:20:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2023-12-19 15:20:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:35,000 INFO L225 Difference]: With dead ends: 1055 [2023-12-19 15:20:35,001 INFO L226 Difference]: Without dead ends: 640 [2023-12-19 15:20:35,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:20:35,003 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 179 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:35,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 483 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:20:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2023-12-19 15:20:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 608. [2023-12-19 15:20:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 472 states have (on average 1.0805084745762712) internal successors, (510), 478 states have internal predecessors, (510), 113 states have call successors, (113), 22 states have call predecessors, (113), 22 states have return successors, (113), 107 states have call predecessors, (113), 113 states have call successors, (113) [2023-12-19 15:20:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 736 transitions. [2023-12-19 15:20:35,083 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 736 transitions. Word has length 154 [2023-12-19 15:20:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:35,084 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 736 transitions. [2023-12-19 15:20:35,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:20:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 736 transitions. [2023-12-19 15:20:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-19 15:20:35,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:35,085 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:35,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-19 15:20:35,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:35,292 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:35,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1920014915, now seen corresponding path program 1 times [2023-12-19 15:20:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:35,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070117444] [2023-12-19 15:20:35,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:35,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:35,315 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143027944] [2023-12-19 15:20:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:35,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:35,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:35,316 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:35,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-19 15:20:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:35,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-19 15:20:35,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:36,616 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-19 15:20:36,763 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-19 15:20:36,954 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 31 treesize of output 22 [2023-12-19 15:20:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 15:20:37,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:37,137 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 55 treesize of output 47 [2023-12-19 15:20:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070117444] [2023-12-19 15:20:37,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143027944] [2023-12-19 15:20:37,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143027944] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:37,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-12-19 15:20:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815597294] [2023-12-19 15:20:37,395 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:20:37,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:20:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:37,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:20:37,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:20:37,396 INFO L87 Difference]: Start difference. First operand 608 states and 736 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:20:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:20:37,834 INFO L93 Difference]: Finished difference Result 1256 states and 1514 transitions. [2023-12-19 15:20:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:20:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2023-12-19 15:20:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:20:37,839 INFO L225 Difference]: With dead ends: 1256 [2023-12-19 15:20:37,839 INFO L226 Difference]: Without dead ends: 709 [2023-12-19 15:20:37,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:20:37,841 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 234 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:20:37,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 387 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:20:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-12-19 15:20:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 532. [2023-12-19 15:20:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 413 states have (on average 1.0750605326876512) internal successors, (444), 417 states have internal predecessors, (444), 97 states have call successors, (97), 21 states have call predecessors, (97), 21 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2023-12-19 15:20:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 638 transitions. [2023-12-19 15:20:37,935 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 638 transitions. Word has length 154 [2023-12-19 15:20:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:20:37,935 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 638 transitions. [2023-12-19 15:20:37,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:20:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 638 transitions. [2023-12-19 15:20:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-19 15:20:37,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:20:37,937 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:20:37,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-19 15:20:38,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:38,144 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:20:38,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:20:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1661849477, now seen corresponding path program 1 times [2023-12-19 15:20:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:20:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603438319] [2023-12-19 15:20:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:20:38,164 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:20:38,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922731968] [2023-12-19 15:20:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:20:38,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:20:38,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:20:38,165 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:20:38,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-19 15:20:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:20:38,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-19 15:20:38,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:20:39,891 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-19 15:20:40,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-19 15:20:40,766 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-19 15:20:41,371 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-19 15:20:41,860 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 13 [2023-12-19 15:20:42,926 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 62 treesize of output 55 [2023-12-19 15:20:43,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:20:43,861 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 3 case distinctions, treesize of input 82 treesize of output 46 [2023-12-19 15:20:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 17 proven. 322 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-12-19 15:20:43,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:20:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:20:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603438319] [2023-12-19 15:20:58,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:20:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922731968] [2023-12-19 15:20:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922731968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:20:58,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:20:58,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2023-12-19 15:20:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168037982] [2023-12-19 15:20:58,349 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:20:58,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-19 15:20:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:20:58,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-19 15:20:58,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=2033, Unknown=2, NotChecked=0, Total=2450 [2023-12-19 15:20:58,351 INFO L87 Difference]: Start difference. First operand 532 states and 638 transitions. Second operand has 32 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 27 states have internal predecessors, (72), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-19 15:21:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:06,060 INFO L93 Difference]: Finished difference Result 1095 states and 1302 transitions. [2023-12-19 15:21:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-19 15:21:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 27 states have internal predecessors, (72), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 154 [2023-12-19 15:21:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:06,063 INFO L225 Difference]: With dead ends: 1095 [2023-12-19 15:21:06,063 INFO L226 Difference]: Without dead ends: 628 [2023-12-19 15:21:06,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1582, Invalid=7158, Unknown=2, NotChecked=0, Total=8742 [2023-12-19 15:21:06,066 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 358 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:06,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1388 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-19 15:21:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2023-12-19 15:21:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 486. [2023-12-19 15:21:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 382 states have (on average 1.0759162303664922) internal successors, (411), 386 states have internal predecessors, (411), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-19 15:21:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 581 transitions. [2023-12-19 15:21:06,136 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 581 transitions. Word has length 154 [2023-12-19 15:21:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:06,136 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 581 transitions. [2023-12-19 15:21:06,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 27 states have internal predecessors, (72), 6 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-19 15:21:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 581 transitions. [2023-12-19 15:21:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-19 15:21:06,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:06,138 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:06,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-19 15:21:06,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:06,346 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:06,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -379991348, now seen corresponding path program 1 times [2023-12-19 15:21:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129596435] [2023-12-19 15:21:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:06,368 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:21:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007650795] [2023-12-19 15:21:06,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:06,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:06,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:21:06,371 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:21:06,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-19 15:21:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:06,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 15:21:06,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:21:06,669 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-19 15:21:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 15:21:06,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:21:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129596435] [2023-12-19 15:21:06,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:21:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007650795] [2023-12-19 15:21:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007650795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:21:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:21:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:21:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079673253] [2023-12-19 15:21:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:21:06,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:21:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:06,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:21:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:21:06,680 INFO L87 Difference]: Start difference. First operand 486 states and 581 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:21:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:06,786 INFO L93 Difference]: Finished difference Result 787 states and 941 transitions. [2023-12-19 15:21:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:21:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-19 15:21:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:06,788 INFO L225 Difference]: With dead ends: 787 [2023-12-19 15:21:06,788 INFO L226 Difference]: Without dead ends: 503 [2023-12-19 15:21:06,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 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-19 15:21:06,790 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 61 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:06,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 496 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:21:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-12-19 15:21:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 486. [2023-12-19 15:21:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 382 states have (on average 1.068062827225131) internal successors, (408), 386 states have internal predecessors, (408), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-19 15:21:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 578 transitions. [2023-12-19 15:21:06,860 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 578 transitions. Word has length 155 [2023-12-19 15:21:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:06,861 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 578 transitions. [2023-12-19 15:21:06,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 15:21:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 578 transitions. [2023-12-19 15:21:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-19 15:21:06,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:06,862 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:06,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-12-19 15:21:07,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:07,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:07,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash 85515454, now seen corresponding path program 1 times [2023-12-19 15:21:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:07,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361275669] [2023-12-19 15:21:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:07,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:07,086 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:21:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30250853] [2023-12-19 15:21:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:07,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:07,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:21:07,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:21:07,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-19 15:21:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:07,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-19 15:21:07,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:21:08,434 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-19 15:21:08,570 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-19 15:21:08,722 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 34 treesize of output 33 [2023-12-19 15:21:09,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:21:09,024 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 1 case distinctions, treesize of input 46 treesize of output 30 [2023-12-19 15:21:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-19 15:21:09,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:21:09,556 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-19 15:21:09,557 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 80 treesize of output 64 [2023-12-19 15:21:14,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base)) (.cse4 (mod (select (select |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) 65536))) (and (forall ((v_z_32 Int)) (or (< v_z_32 0) (forall ((v_y_32 Int)) (let ((.cse0 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse0) (< .cse0 0) (forall ((v_z_34 Int)) (let ((.cse1 (+ .cse4 v_z_34 v_z_32))) (or (< 65535 v_z_34) (< .cse1 131072) (forall ((v_y_34 Int)) (let ((.cse5 (* 65536 v_y_34))) (let ((.cse2 (+ v_z_34 .cse5))) (or (< .cse2 0) (= .cse1 (+ 131072 (mod (+ v_z_34 v_z_32 (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_34 .cse5))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) 65536))) (< 255 .cse2))))))))))) (< 65535 v_z_32))) (forall ((v_z_32 Int)) (or (forall ((v_y_32 Int)) (let ((.cse6 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse6) (< .cse6 0) (forall ((v_z_33 Int)) (or (< 65535 (+ .cse4 v_z_33)) (< v_z_33 0) (forall ((v_y_33 Int)) (let ((.cse10 (* 65536 v_y_33))) (let ((.cse8 (mod (+ (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ .cse10 (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_33))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) v_z_33 v_z_32) 65536)) (.cse7 (+ .cse4 v_z_33 v_z_32)) (.cse9 (+ .cse10 v_z_33))) (or (= .cse7 (+ 65536 .cse8)) (< 255 .cse9) (= .cse8 .cse7) (< .cse9 0)))))))))) (< v_z_32 0) (< 65535 v_z_32))) (forall ((v_z_32 Int)) (or (< v_z_32 0) (forall ((v_y_32 Int)) (let ((.cse11 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse11) (< .cse11 0) (forall ((v_z_33 Int)) (let ((.cse12 (+ .cse4 v_z_33 v_z_32))) (or (< 65535 .cse12) (forall ((v_y_33 Int)) (let ((.cse14 (* 65536 v_y_33))) (let ((.cse13 (+ .cse14 v_z_33))) (or (< 255 .cse13) (= (mod (+ (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ .cse14 (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_33))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) v_z_33 v_z_32) 65536) .cse12) (< .cse13 0))))) (< v_z_33 0))))))) (< 65535 v_z_32))) (forall ((v_z_32 Int)) (or (< v_z_32 0) (forall ((v_y_32 Int)) (let ((.cse15 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse15) (< .cse15 0) (forall ((v_z_33 Int)) (or (forall ((v_y_33 Int)) (let ((.cse19 (* 65536 v_y_33))) (let ((.cse18 (+ .cse19 v_z_33)) (.cse17 (mod (+ (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ .cse19 (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_33))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) v_z_33 v_z_32) 65536)) (.cse16 (+ .cse4 v_z_33 v_z_32))) (or (= .cse16 (+ 65536 .cse17)) (< 255 .cse18) (= .cse17 .cse16) (< .cse18 0) (= (+ 131072 .cse17) .cse16))))) (< 65535 v_z_33) (< v_z_33 0)))))) (< 65535 v_z_32))) (forall ((v_z_32 Int)) (or (< v_z_32 0) (< 65535 v_z_32) (forall ((v_y_32 Int)) (let ((.cse20 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse20) (< .cse20 0) (forall ((v_z_34 Int)) (let ((.cse21 (+ .cse4 v_z_34 v_z_32))) (or (< .cse21 65536) (< 65535 (+ .cse4 v_z_34)) (forall ((v_y_34 Int)) (let ((.cse22 (* 65536 v_y_34))) (let ((.cse23 (+ v_z_34 .cse22))) (or (= (+ 65536 (mod (+ v_z_34 v_z_32 (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_34 .cse22))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) 65536)) .cse21) (< .cse23 0) (< 255 .cse23))))) (< v_z_34 0))))))))) (forall ((v_z_32 Int)) (or (< v_z_32 0) (forall ((v_y_32 Int)) (let ((.cse24 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse24) (< .cse24 0) (forall ((v_z_33 Int)) (let ((.cse25 (+ .cse4 v_z_33 v_z_32))) (or (forall ((v_y_33 Int)) (let ((.cse26 (* 65536 v_y_33))) (let ((.cse27 (+ .cse26 v_z_33))) (or (= .cse25 (+ 65536 (mod (+ (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ .cse26 (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_33))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) v_z_33 v_z_32) 65536))) (< 255 .cse27) (< .cse27 0))))) (< (+ .cse4 v_z_33) 65536) (< 65535 v_z_33) (< 131071 .cse25))))))) (< 65535 v_z_32))) (forall ((v_z_32 Int)) (or (forall ((v_y_32 Int)) (let ((.cse28 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse28) (< .cse28 0) (forall ((v_z_33 Int)) (or (< (+ .cse4 v_z_33) 65536) (forall ((v_y_33 Int)) (let ((.cse32 (* 65536 v_y_33))) (let ((.cse31 (+ .cse32 v_z_33)) (.cse30 (mod (+ (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ .cse32 (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_33))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) v_z_33 v_z_32) 65536)) (.cse29 (+ .cse4 v_z_33 v_z_32))) (or (= .cse29 (+ 65536 .cse30)) (< 255 .cse31) (< .cse31 0) (= (+ 131072 .cse30) .cse29))))) (< 65535 v_z_33)))))) (< v_z_32 0) (< 65535 v_z_32))) (forall ((v_z_32 Int)) (or (< v_z_32 0) (< 65535 v_z_32) (forall ((v_y_32 Int)) (let ((.cse33 (+ (* v_z_32 65535) (* 65536 v_y_32)))) (or (< 255 .cse33) (< .cse33 0) (forall ((v_z_33 Int)) (let ((.cse34 (+ .cse4 v_z_33 v_z_32))) (or (< 65535 v_z_33) (< v_z_33 0) (forall ((v_y_33 Int)) (let ((.cse37 (* 65536 v_y_33))) (let ((.cse35 (mod (+ (select (select (store |c_#memory_int#5| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset (+ .cse37 (* v_z_32 (- 65535)) (* v_y_32 (- 65536)) .cse4 v_z_33))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset) v_z_33 v_z_32) 65536)) (.cse36 (+ .cse37 v_z_33))) (or (= .cse34 (+ 65536 .cse35)) (< 255 .cse36) (= .cse35 .cse34) (< .cse36 0))))) (< 131071 .cse34))))))))))) is different from false [2023-12-19 15:21:17,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:17,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361275669] [2023-12-19 15:21:17,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:21:17,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30250853] [2023-12-19 15:21:17,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30250853] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:21:17,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:21:17,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-12-19 15:21:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946337786] [2023-12-19 15:21:17,071 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:21:17,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:21:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:17,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:21:17,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=356, Unknown=1, NotChecked=38, Total=462 [2023-12-19 15:21:17,072 INFO L87 Difference]: Start difference. First operand 486 states and 578 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:21:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:18,879 INFO L93 Difference]: Finished difference Result 947 states and 1116 transitions. [2023-12-19 15:21:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 15:21:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-12-19 15:21:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:18,882 INFO L225 Difference]: With dead ends: 947 [2023-12-19 15:21:18,882 INFO L226 Difference]: Without dead ends: 663 [2023-12-19 15:21:18,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=271, Invalid=1138, Unknown=1, NotChecked=72, Total=1482 [2023-12-19 15:21:18,884 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 143 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:18,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 799 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 15:21:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2023-12-19 15:21:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 517. [2023-12-19 15:21:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 403 states have (on average 1.0620347394540943) internal successors, (428), 408 states have internal predecessors, (428), 93 states have call successors, (93), 20 states have call predecessors, (93), 20 states have return successors, (93), 88 states have call predecessors, (93), 93 states have call successors, (93) [2023-12-19 15:21:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 614 transitions. [2023-12-19 15:21:18,984 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 614 transitions. Word has length 157 [2023-12-19 15:21:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:18,984 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 614 transitions. [2023-12-19 15:21:18,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 15:21:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 614 transitions. [2023-12-19 15:21:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-19 15:21:18,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:18,986 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:21:18,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-19 15:21:19,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 15:21:19,194 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:19,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1045280766, now seen corresponding path program 1 times [2023-12-19 15:21:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978894978] [2023-12-19 15:21:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:19,214 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:21:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769714650] [2023-12-19 15:21:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:19,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:21:19,216 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:21:19,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-19 15:21:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:19,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-19 15:21:19,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:21:21,068 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-19 15:21:21,395 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-19 15:21:21,953 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-19 15:21:22,913 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-19 15:21:23,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:21:23,666 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-19 15:21:23,666 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 26 treesize of output 28 [2023-12-19 15:21:23,911 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 43 [2023-12-19 15:21:24,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:21:24,605 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 1 case distinctions, treesize of input 64 treesize of output 40 [2023-12-19 15:21:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 364 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-19 15:21:24,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:21:27,119 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 556 treesize of output 532 [2023-12-19 15:21:27,916 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 91 treesize of output 83 [2023-12-19 15:21:28,162 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 91 treesize of output 83 [2023-12-19 15:21:28,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 91 treesize of output 83 [2023-12-19 15:21:28,653 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 91 treesize of output 83 [2023-12-19 15:21:28,874 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 91 treesize of output 83 [2023-12-19 15:21:29,194 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 91 treesize of output 83 [2023-12-19 15:21:29,469 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 91 treesize of output 83 [2023-12-19 15:21:29,702 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 91 treesize of output 83 [2023-12-19 15:21:45,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:21:45,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978894978] [2023-12-19 15:21:45,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:21:45,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769714650] [2023-12-19 15:21:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769714650] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:21:45,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:21:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2023-12-19 15:21:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974539324] [2023-12-19 15:21:45,824 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:21:45,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 15:21:45,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:21:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 15:21:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1662, Unknown=3, NotChecked=0, Total=2070 [2023-12-19 15:21:45,825 INFO L87 Difference]: Start difference. First operand 517 states and 614 transitions. Second operand has 28 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 5 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-19 15:21:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:21:52,383 INFO L93 Difference]: Finished difference Result 998 states and 1165 transitions. [2023-12-19 15:21:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-19 15:21:52,384 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 5 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 157 [2023-12-19 15:21:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:21:52,386 INFO L225 Difference]: With dead ends: 998 [2023-12-19 15:21:52,386 INFO L226 Difference]: Without dead ends: 718 [2023-12-19 15:21:52,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 183 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=1583, Invalid=5724, Unknown=3, NotChecked=0, Total=7310 [2023-12-19 15:21:52,389 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 431 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:21:52,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1526 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2929 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-19 15:21:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-19 15:21:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 513. [2023-12-19 15:21:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 399 states have (on average 1.0576441102756893) internal successors, (422), 404 states have internal predecessors, (422), 90 states have call successors, (90), 23 states have call predecessors, (90), 23 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-19 15:21:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 602 transitions. [2023-12-19 15:21:52,482 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 602 transitions. Word has length 157 [2023-12-19 15:21:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:21:52,483 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 602 transitions. [2023-12-19 15:21:52,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 5 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-19 15:21:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 602 transitions. [2023-12-19 15:21:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2023-12-19 15:21:52,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:21:52,485 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-19 15:21:52,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-12-19 15:21:52,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-19 15:21:52,693 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:21:52,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:21:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2008938782, now seen corresponding path program 1 times [2023-12-19 15:21:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:21:52,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967508828] [2023-12-19 15:21:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:21:52,720 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:21:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784552924] [2023-12-19 15:21:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:21:52,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:21:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:21:52,721 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:21:52,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-19 15:21:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:21:53,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-19 15:21:53,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:21:54,663 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-19 15:21:55,163 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 13 [2023-12-19 15:21:55,796 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 13 [2023-12-19 15:21:57,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-12-19 15:21:59,880 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 0 case distinctions, treesize of input 36 treesize of output 16 [2023-12-19 15:22:00,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:22:00,678 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 13 [2023-12-19 15:22:01,625 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-19 15:22:02,582 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 43 [2023-12-19 15:22:03,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:22:03,199 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 1 case distinctions, treesize of input 64 treesize of output 40 [2023-12-19 15:22:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3188 backedges. 415 proven. 2238 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2023-12-19 15:22:03,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:22:05,305 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 412 treesize of output 388 [2023-12-19 15:22:05,971 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 67 treesize of output 59 [2023-12-19 15:22:06,253 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 67 treesize of output 59 [2023-12-19 15:22:06,634 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 67 treesize of output 59 [2023-12-19 15:22:06,899 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 67 treesize of output 59 [2023-12-19 15:22:07,222 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 67 treesize of output 59 [2023-12-19 15:22:07,648 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 67 treesize of output 59 [2023-12-19 15:22:07,914 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 67 treesize of output 59 [2023-12-19 15:22:08,116 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 67 treesize of output 59 [2023-12-19 15:22:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:22:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967508828] [2023-12-19 15:22:08,974 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:22:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784552924] [2023-12-19 15:22:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784552924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:22:08,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:22:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2023-12-19 15:22:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934962343] [2023-12-19 15:22:08,974 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-19 15:22:08,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-19 15:22:08,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:22:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-19 15:22:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=2044, Unknown=0, NotChecked=0, Total=2550 [2023-12-19 15:22:08,976 INFO L87 Difference]: Start difference. First operand 513 states and 602 transitions. Second operand has 34 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 9 states have call successors, (40), 7 states have call predecessors, (40), 9 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) [2023-12-19 15:22:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:22:20,797 INFO L93 Difference]: Finished difference Result 1044 states and 1202 transitions. [2023-12-19 15:22:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-19 15:22:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 9 states have call successors, (40), 7 states have call predecessors, (40), 9 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) Word has length 306 [2023-12-19 15:22:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:22:20,801 INFO L225 Difference]: With dead ends: 1044 [2023-12-19 15:22:20,801 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 15:22:20,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 324 SyntacticMatches, 8 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3838 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=2782, Invalid=11260, Unknown=0, NotChecked=0, Total=14042 [2023-12-19 15:22:20,806 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 471 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 4442 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 4614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 4442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-19 15:22:20,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 2129 Invalid, 4614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 4442 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-19 15:22:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 15:22:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 15:22:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 15:22:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 15:22:20,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2023-12-19 15:22:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:22:20,807 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 15:22:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 9 states have call successors, (40), 7 states have call predecessors, (40), 9 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) [2023-12-19 15:22:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 15:22:20,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 15:22:20,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:22:20,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-12-19 15:22:21,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-19 15:22:21,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 15:23:30,028 WARN L293 SmtUtils]: Spent 14.00s on a formula simplification. DAG size of input: 261 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:23:38,395 WARN L293 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 240 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:23:47,234 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 240 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:23:55,376 WARN L293 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 240 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:24:02,017 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 240 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:24:12,950 WARN L293 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 240 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:24:25,502 WARN L293 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 261 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:25:13,428 WARN L293 SmtUtils]: Spent 46.55s on a formula simplification. DAG size of input: 1067 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:25:30,165 WARN L293 SmtUtils]: Spent 16.37s on a formula simplification. DAG size of input: 274 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:25:38,442 WARN L293 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 240 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-19 15:25:39,098 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 15:25:39,098 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 15:25:39,098 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 15:25:39,098 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 15:25:39,098 INFO L899 garLoopResultBuilder]: For program point L117-20(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,098 INFO L899 garLoopResultBuilder]: For program point L117-22(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,098 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse34 (select |#memory_int#4| 7))) (let ((.cse31 (mod (select .cse34 0) 256)) (.cse10 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (.cse32 (select .cse34 2)) (.cse33 (mod (select .cse34 3) 256))) (let ((.cse12 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse33)) (.cse11 (mod .cse32 256)) (.cse24 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse29 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse30 (mod 2 .cse33)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse10 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse28 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= .cse33 0))) (.cse13 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse16 (<= .cse31 254)) (.cse17 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse21 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse26 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse27 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse7 4) 65536)) .cse8 .cse9 (= (+ .cse10 .cse11) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse11 254) .cse26 .cse27) (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse10) .cse2 .cse3 .cse4 .cse6 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse9 (or (and .cse0 .cse1 .cse5 (= .cse12 (+ .cse28 .cse11)) .cse15 .cse23 .cse24 .cse25 .cse26) (and (or (and .cse0 .cse1 .cse5 .cse15 (<= (+ (* (div .cse11 .cse29) .cse30) 1) .cse31) .cse24 .cse26) (and .cse0 .cse1 .cse5 .cse15 (= .cse11 .cse31) .cse24 .cse26)) .cse23 .cse25)) .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse27) (and .cse0 .cse1 (<= (+ (* (div 10 .cse29) .cse30) 1) .cse31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse28 .cse10) (= .cse32 10) .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 16383 (mod (select .cse7 2) 65536)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27))))) [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-24(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 68) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-26(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-27(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-29(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-30(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-32(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-33(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L117-35(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 15:25:39,099 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 15:25:39,100 INFO L895 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (let ((.cse27 (select |#memory_int#4| 7)) (.cse11 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= |ULTIMATE.start_updateVariables_#t~mem63#1| (select .cse23 4))) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse4 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse7 (<= 16383 (mod (select .cse11 4) 65536))) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse10 (not (= (mod (select .cse27 3) 256) 0))) (.cse12 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse13 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse14 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse15 (<= (mod (select .cse27 0) 256) 254)) (.cse16 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse19 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse20 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse21 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse22 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse24 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse8 (select .cse27 2)) (.cse25 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse26 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 10) .cse9 .cse10 (<= (mod (select .cse11 2) 65536) 32767) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 16383 (mod (select .cse23 2) 65536)) .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse24 (<= (mod .cse8 256) 254) .cse25 .cse26)))) [2023-12-19 15:25:39,100 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-12-19 15:25:39,100 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse5 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse7 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse8 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse11 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse13 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse14 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse15 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse16 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse17 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse19 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (let ((.cse6 (select |#memory_int#4| 7))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (= (select .cse6 2) 10) .cse7 .cse8 .cse9 .cse10 (<= (mod (select .cse6 0) 256) 254) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (and .cse0 .cse1 (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) .cse2 .cse3 .cse4 .cse5 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse18 .cse19 .cse20))) [2023-12-19 15:25:39,100 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-19 15:25:39,100 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 65) no Hoare annotation was computed. [2023-12-19 15:25:39,100 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse34 (select |#memory_int#4| 7))) (let ((.cse31 (mod (select .cse34 0) 256)) (.cse10 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (.cse32 (select .cse34 2)) (.cse33 (mod (select .cse34 3) 256))) (let ((.cse12 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse33)) (.cse11 (mod .cse32 256)) (.cse24 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse29 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse30 (mod 2 .cse33)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse10 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse28 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= .cse33 0))) (.cse13 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse16 (<= .cse31 254)) (.cse17 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse21 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse26 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse27 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse7 4) 65536)) .cse8 .cse9 (= (+ .cse10 .cse11) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse11 254) .cse26 .cse27) (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse10) .cse2 .cse3 .cse4 .cse6 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse9 (or (and .cse0 .cse1 .cse5 (= .cse12 (+ .cse28 .cse11)) .cse15 .cse23 .cse24 .cse25 .cse26) (and (or (and .cse0 .cse1 .cse5 .cse15 (<= (+ (* (div .cse11 .cse29) .cse30) 1) .cse31) .cse24 .cse26) (and .cse0 .cse1 .cse5 .cse15 (= .cse11 .cse31) .cse24 .cse26)) .cse23 .cse25)) .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse27) (and .cse0 .cse1 (<= (+ (* (div 10 .cse29) .cse30) 1) .cse31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse28 .cse10) (= .cse32 10) .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 16383 (mod (select .cse7 2) 65536)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27))))) [2023-12-19 15:25:39,100 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-19 15:25:39,101 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse5 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse7 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse8 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse11 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse13 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse14 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse15 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse16 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse17 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse19 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (let ((.cse6 (select |#memory_int#4| 7))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (= (select .cse6 2) 10) .cse7 .cse8 .cse9 .cse10 (<= (mod (select .cse6 0) 256) 254) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (and .cse0 .cse1 (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) .cse2 .cse3 .cse4 .cse5 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse18 .cse19 .cse20))) [2023-12-19 15:25:39,101 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-19 15:25:39,101 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 72) no Hoare annotation was computed. [2023-12-19 15:25:39,101 INFO L899 garLoopResultBuilder]: For program point L70-2(lines 70 72) no Hoare annotation was computed. [2023-12-19 15:25:39,101 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse24 (select |#memory_int#4| 7)) (.cse7 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse7 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse15 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse10 (not (= (mod (select .cse24 3) 256) 0))) (.cse11 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse13 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse16 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse17 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse18 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse20 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse21 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse8 (select .cse24 2)) (.cse22 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse23 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) .cse7) (= .cse8 10) .cse9 .cse10 .cse11 .cse12 .cse13 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse14 (<= 16383 (mod (select .cse15 2) 65536)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse15 4) 65536)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse16 .cse17 .cse18 .cse19 .cse20 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse21 (<= (mod .cse8 256) 254) .cse22 .cse23)))) [2023-12-19 15:25:39,101 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-19 15:25:39,102 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse34 (select |#memory_int#4| 7))) (let ((.cse31 (mod (select .cse34 0) 256)) (.cse10 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (.cse32 (select .cse34 2)) (.cse33 (mod (select .cse34 3) 256))) (let ((.cse12 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse33)) (.cse11 (mod .cse32 256)) (.cse24 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse29 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse30 (mod 2 .cse33)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse10 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse28 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= .cse33 0))) (.cse13 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse16 (<= .cse31 254)) (.cse17 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse21 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse26 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse27 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse7 4) 65536)) .cse8 .cse9 (= (+ .cse10 .cse11) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse11 254) .cse26 .cse27) (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse10) .cse2 .cse3 .cse4 .cse6 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse9 (or (and .cse0 .cse1 .cse5 (= .cse12 (+ .cse28 .cse11)) .cse15 .cse23 .cse24 .cse25 .cse26) (and (or (and .cse0 .cse1 .cse5 .cse15 (<= (+ (* (div .cse11 .cse29) .cse30) 1) .cse31) .cse24 .cse26) (and .cse0 .cse1 .cse5 .cse15 (= .cse11 .cse31) .cse24 .cse26)) .cse23 .cse25)) .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse27) (and .cse0 .cse1 (<= (+ (* (div 10 .cse29) .cse30) 1) .cse31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse28 .cse10) (= .cse32 10) .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 16383 (mod (select .cse7 2) 65536)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27))))) [2023-12-19 15:25:39,102 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-19 15:25:39,102 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 15:25:39,102 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse7 (select |#memory_int#4| 7))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= |ULTIMATE.start_updateVariables_#t~mem57#1| (select .cse7 3))) (.cse4 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse8 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse9 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse10 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse11 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse12 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse13 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse14 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse15 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse16 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (= (select .cse7 2) 10) (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) .cse9 (<= (mod (select .cse7 0) 256) 254) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) .cse2 .cse3 .cse4 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base |~#unsigned_char_Array_0~0.base|) .cse5 .cse6 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base |~#unsigned_char_Array_0~0.base|) (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse17 .cse18 .cse19)))) [2023-12-19 15:25:39,102 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-19 15:25:39,102 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-19 15:25:39,102 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2023-12-19 15:25:39,102 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse25 (select |#memory_int#4| 7)) (.cse7 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse7 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse16 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse9 (= |ULTIMATE.start_updateVariables_#t~mem49#1| (select .cse25 0))) (.cse10 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse11 (not (= (mod (select .cse25 3) 256) 0))) (.cse12 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse13 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse14 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse15 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse18 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse19 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse20 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse21 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse8 (select .cse25 2)) (.cse23 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse24 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) .cse7) (= .cse8 10) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse15 (<= 16383 (mod (select .cse16 2) 65536)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse16 4) 65536)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse17 .cse18 .cse19 .cse20 .cse21 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse22 (<= (mod .cse8 256) 254) .cse23 .cse24)))) [2023-12-19 15:25:39,102 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-19 15:25:39,103 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse34 (select |#memory_int#4| 7))) (let ((.cse31 (mod (select .cse34 0) 256)) (.cse10 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (.cse32 (select .cse34 2)) (.cse33 (mod (select .cse34 3) 256))) (let ((.cse12 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse33)) (.cse11 (mod .cse32 256)) (.cse24 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse29 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse30 (mod 2 .cse33)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse10 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse28 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= .cse33 0))) (.cse13 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse16 (<= .cse31 254)) (.cse17 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse21 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse26 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse27 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse7 4) 65536)) .cse8 .cse9 (= (+ .cse10 .cse11) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse11 254) .cse26 .cse27) (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse10) .cse2 .cse3 .cse4 .cse6 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse9 (or (and .cse0 .cse1 .cse5 (= .cse12 (+ .cse28 .cse11)) .cse15 .cse23 .cse24 .cse25 .cse26) (and (or (and .cse0 .cse1 .cse5 .cse15 (<= (+ (* (div .cse11 .cse29) .cse30) 1) .cse31) .cse24 .cse26) (and .cse0 .cse1 .cse5 .cse15 (= .cse11 .cse31) .cse24 .cse26)) .cse23 .cse25)) .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse27) (and .cse0 .cse1 (<= (+ (* (div 10 .cse29) .cse30) 1) .cse31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse28 .cse10) (= .cse32 10) .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 16383 (mod (select .cse7 2) 65536)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27))))) [2023-12-19 15:25:39,103 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-19 15:25:39,103 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse23 (select |#memory_int#4| 7))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse5 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse20 (select .cse23 2)) (.cse6 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse7 (not (= (mod (select .cse23 3) 256) 0))) (.cse8 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse11 (<= (mod (select .cse23 0) 256) 254)) (.cse12 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse13 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse14 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse15 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse16 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse21 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse19 (<= (mod .cse20 256) 254) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_updateVariables_#t~mem59#1| (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) 2)) (= .cse20 10) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22)))) [2023-12-19 15:25:39,103 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-19 15:25:39,103 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse26 (select |#memory_int#4| 7)) (.cse7 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse7 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse16 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse10 (not (= (mod (select .cse26 3) 256) 0))) (.cse11 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse13 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse14 (<= (mod (select .cse26 0) 256) 254)) (.cse15 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse19 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse20 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse21 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse22 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse23 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse8 (select .cse26 2)) (.cse24 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) .cse7) (= .cse8 10) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 16383 (mod (select .cse16 2) 65536)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse16 4) 65536)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse23 (<= (mod .cse8 256) 254) .cse24 .cse25)))) [2023-12-19 15:25:39,103 INFO L899 garLoopResultBuilder]: For program point L98-1(line 98) no Hoare annotation was computed. [2023-12-19 15:25:39,103 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse34 (select |#memory_int#4| 7))) (let ((.cse31 (mod (select .cse34 0) 256)) (.cse10 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (.cse32 (select .cse34 2)) (.cse33 (mod (select .cse34 3) 256))) (let ((.cse12 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse33)) (.cse11 (mod .cse32 256)) (.cse24 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse29 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse30 (mod 2 .cse33)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse10 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse28 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= .cse33 0))) (.cse13 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse16 (<= .cse31 254)) (.cse17 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse21 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse26 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse27 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse7 4) 65536)) .cse8 .cse9 (= (+ .cse10 .cse11) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse11 254) .cse26 .cse27) (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse10) .cse2 .cse3 .cse4 .cse6 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse9 (or (and .cse0 .cse1 .cse5 (= .cse12 (+ .cse28 .cse11)) .cse15 .cse23 .cse24 .cse25 .cse26) (and (or (and .cse0 .cse1 .cse5 .cse15 (<= (+ (* (div .cse11 .cse29) .cse30) 1) .cse31) .cse24 .cse26) (and .cse0 .cse1 .cse5 .cse15 (= .cse11 .cse31) .cse24 .cse26)) .cse23 .cse25)) .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse27) (and .cse0 .cse1 (<= (+ (* (div 10 .cse29) .cse30) 1) .cse31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse28 .cse10) (= .cse32 10) .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 16383 (mod (select .cse7 2) 65536)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27))))) [2023-12-19 15:25:39,103 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-19 15:25:39,104 INFO L895 garLoopResultBuilder]: At program point L123-2(lines 123 129) the Hoare annotation is: (let ((.cse43 (select |#memory_int#4| 7))) (let ((.cse32 (select .cse43 2))) (let ((.cse15 (mod (select .cse43 0) 256)) (.cse12 (mod .cse32 256)) (.cse45 (select |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse41 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse38 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse31 (<= .cse41 .cse38)) (.cse7 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse8 (= .cse12 (select .cse45 8))) (.cse9 (forall ((v_ArrVal_445 Int) (v_ArrVal_444 Int)) (= (select (select (let ((.cse44 (store |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base (store .cse45 8 v_ArrVal_444)))) (store .cse44 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base (store (select .cse44 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) 0 v_ArrVal_445))) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset) 0))) (.cse10 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse11 (= .cse15 (select (select |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) 0))) (.cse16 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse17 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse42 (mod (select .cse43 3) 256))) (let ((.cse13 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse14 (mod 2 .cse42)) (.cse37 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse33 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse34 (not (= .cse42 0))) (.cse35 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse36 (<= .cse15 254)) (.cse0 (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254)) (.cse1 (<= 16383 .cse38)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base |~#unsigned_char_Array_0~0.base|)) (.cse5 (<= .cse38 32767)) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse18 (not (= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base) 3) 256) 0))) (.cse39 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse42)) (.cse19 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254)) (.cse20 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse21 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse40 (or (and .cse7 .cse8 .cse9 .cse31 .cse10 .cse11 .cse16 .cse17) (and .cse7 .cse8 .cse9 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse10 .cse11 .cse16 .cse17))) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse23 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse24 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse25 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse26 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse27 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse28 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse29 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse30 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or (and .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ (* (div .cse12 .cse13) .cse14) 1) .cse15) .cse16 .cse17) (and .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 .cse15) .cse16 .cse17)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse7 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8))) (<= (+ (* (div 10 .cse13) .cse14) 1) .cse15) .cse2 .cse3 .cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base))) .cse6 .cse31 (= .cse32 10) .cse33 .cse34 .cse20 .cse35 (<= (mod (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset) 256) 0) .cse10 .cse36 .cse21 (<= 16383 (mod (select .cse37 2) 65536)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse17 .cse30) (and .cse2 .cse3 .cse5 .cse6 (<= 16383 (mod (select .cse37 4) 65536)) .cse33 .cse34 (= (+ .cse38 .cse12) .cse39) .cse20 .cse35 .cse36 .cse21 .cse40 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= .cse12 254) .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (= .cse39 (+ .cse41 .cse12)) .cse19 .cse20 .cse21 .cse40 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30))))))) [2023-12-19 15:25:39,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 15:25:39,104 INFO L899 garLoopResultBuilder]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2023-12-19 15:25:39,104 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse24 (select |#memory_int#4| 7))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse5 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse20 (select .cse24 2)) (.cse6 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse7 (not (= (mod (select .cse24 3) 256) 0))) (.cse8 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse10 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse11 (<= (mod (select .cse24 0) 256) 254)) (.cse12 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse13 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse14 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse15 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse16 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse21 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse19 (<= (mod .cse20 256) 254) .cse21 .cse22) (let ((.cse23 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_updateVariables_#t~mem60#1| .cse23) (= .cse20 10) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 16383 (mod .cse23 65536)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22))))) [2023-12-19 15:25:39,104 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-12-19 15:25:39,104 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 76) no Hoare annotation was computed. [2023-12-19 15:25:39,104 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 76) no Hoare annotation was computed. [2023-12-19 15:25:39,105 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse26 (select |#memory_int#4| 7)) (.cse7 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse7 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse16 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse10 (not (= (mod (select .cse26 3) 256) 0))) (.cse11 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse13 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse14 (<= (mod (select .cse26 0) 256) 254)) (.cse15 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse19 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse20 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse21 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse22 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse23 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse8 (select .cse26 2)) (.cse24 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) .cse7) (= .cse8 10) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 16383 (mod (select .cse16 2) 65536)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse16 4) 65536)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse23 (<= (mod .cse8 256) 254) .cse24 .cse25)))) [2023-12-19 15:25:39,105 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-19 15:25:39,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 15:25:39,105 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse37 (select |#memory_int#4| 7))) (let ((.cse35 (select .cse37 2))) (let ((.cse13 (mod (select .cse37 0) 256)) (.cse10 (mod .cse35 256)) (.cse39 (select |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse19 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse0 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse34 (<= .cse19 .cse0)) (.cse5 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse6 (= .cse10 (select .cse39 8))) (.cse7 (forall ((v_ArrVal_445 Int) (v_ArrVal_444 Int)) (= (select (select (let ((.cse38 (store |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base (store .cse39 8 v_ArrVal_444)))) (store .cse38 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base (store (select .cse38 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) 0 v_ArrVal_445))) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset) 0))) (.cse8 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse9 (= .cse13 (select (select |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) 0))) (.cse14 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse36 (mod (select .cse37 3) 256))) (let ((.cse18 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse36)) (.cse20 (or (and .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse14 .cse15) (and .cse5 .cse6 .cse7 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse8 .cse9 .cse14 .cse15))) (.cse11 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse12 (mod 2 .cse36)) (.cse1 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse3 (<= .cse0 32767)) (.cse4 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse31 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (not (= .cse36 0))) (.cse22 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse23 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse32 (<= .cse13 254)) (.cse24 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse30 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse33 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse26 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse27 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse28 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse16 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse29 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse0) .cse1 .cse2 .cse3 .cse4 (or (and (or (and .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ (* (div .cse10 .cse11) .cse12) 1) .cse13) .cse14 .cse15) (and .cse5 .cse6 .cse7 .cse8 .cse9 (= .cse10 .cse13) .cse14 .cse15)) .cse16 .cse17) (and (= .cse18 (+ .cse19 .cse10)) .cse20 .cse16 .cse17)) (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse21 .cse22 .cse23 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse24 .cse25 .cse26 .cse27 .cse28 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse29) (and .cse1 .cse2 .cse3 .cse4 (<= 16383 (mod (select .cse30 4) 65536)) .cse31 .cse21 (= (+ .cse0 .cse10) .cse18) .cse22 .cse23 .cse32 .cse24 .cse20 .cse33 .cse25 .cse26 .cse27 .cse28 .cse16 .cse17 (<= .cse10 254) .cse29) (and .cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8))) (<= (+ (* (div 10 .cse11) .cse12) 1) .cse13) .cse1 .cse2 .cse3 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base))) .cse4 .cse34 (= .cse35 10) .cse31 .cse21 .cse22 .cse23 .cse8 .cse32 .cse24 (<= 16383 (mod (select .cse30 2) 65536)) .cse33 .cse25 .cse26 .cse27 .cse28 .cse16 .cse17 .cse15 .cse29))))))) [2023-12-19 15:25:39,105 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-19 15:25:39,105 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-19 15:25:39,106 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-19 15:25:39,106 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse26 (select |#memory_int#4| 7)) (.cse7 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse7 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse16 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse9 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse10 (not (= (mod (select .cse26 3) 256) 0))) (.cse11 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse13 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse14 (<= (mod (select .cse26 0) 256) 254)) (.cse15 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse19 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse20 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse21 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse22 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse23 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse8 (select .cse26 2)) (.cse24 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536) .cse7) (= .cse8 10) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 16383 (mod (select .cse16 2) 65536)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse16 4) 65536)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse23 (<= (mod .cse8 256) 254) .cse24 .cse25)))) [2023-12-19 15:25:39,106 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-19 15:25:39,106 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse34 (select |#memory_int#4| 7))) (let ((.cse31 (mod (select .cse34 0) 256)) (.cse10 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536)) (.cse32 (select .cse34 2)) (.cse33 (mod (select .cse34 3) 256))) (let ((.cse12 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse33)) (.cse11 (mod .cse32 256)) (.cse24 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse29 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse30 (mod 2 .cse33)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (<= .cse10 32767)) (.cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse6 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse28 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= .cse33 0))) (.cse13 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse14 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse16 (<= .cse31 254)) (.cse17 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse7 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse18 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse19 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse20 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse21 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse23 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse26 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse27 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 16383 (mod (select .cse7 4) 65536)) .cse8 .cse9 (= (+ .cse10 .cse11) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse11 254) .cse26 .cse27) (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse10) .cse2 .cse3 .cse4 .cse6 (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse9 (or (and .cse0 .cse1 .cse5 (= .cse12 (+ .cse28 .cse11)) .cse15 .cse23 .cse24 .cse25 .cse26) (and (or (and .cse0 .cse1 .cse5 .cse15 (<= (+ (* (div .cse11 .cse29) .cse30) 1) .cse31) .cse24 .cse26) (and .cse0 .cse1 .cse5 .cse15 (= .cse11 .cse31) .cse24 .cse26)) .cse23 .cse25)) .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse27) (and .cse0 .cse1 (<= (+ (* (div 10 .cse29) .cse30) 1) .cse31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse28 .cse10) (= .cse32 10) .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 16383 (mod (select .cse7 2) 65536)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27))))) [2023-12-19 15:25:39,106 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-19 15:25:39,106 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-12-19 15:25:39,106 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 69) no Hoare annotation was computed. [2023-12-19 15:25:39,106 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,107 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse37 (select |#memory_int#4| 7))) (let ((.cse35 (select .cse37 2))) (let ((.cse13 (mod (select .cse37 0) 256)) (.cse10 (mod .cse35 256)) (.cse39 (select |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse19 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) 2) 65536)) (.cse0 (mod (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) 4) 65536))) (let ((.cse34 (<= .cse19 .cse0)) (.cse5 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse6 (= .cse10 (select .cse39 8))) (.cse7 (forall ((v_ArrVal_445 Int) (v_ArrVal_444 Int)) (= (select (select (let ((.cse38 (store |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base (store .cse39 8 v_ArrVal_444)))) (store .cse38 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base (store (select .cse38 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) 0 v_ArrVal_445))) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset) 0))) (.cse8 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse9 (= .cse13 (select (select |#memory_int#3| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) 0))) (.cse14 (= (+ (select (select |#memory_int#2| ~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) 4) 0)) (.cse15 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse36 (mod (select .cse37 3) 256))) (let ((.cse18 (+ (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) 0) .cse36)) (.cse20 (or (and .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse14 .cse15) (and .cse5 .cse6 .cse7 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse8 .cse9 .cse14 .cse15))) (.cse11 (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) 256)) (.cse12 (mod 2 .cse36)) (.cse1 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse3 (<= .cse0 32767)) (.cse4 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse31 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse21 (not (= .cse36 0))) (.cse22 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse23 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse32 (<= .cse13 254)) (.cse24 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse30 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|)) (.cse33 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse25 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse26 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse27 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse28 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse16 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse29 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (and (<= (mod (select (select |#memory_int#4| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) 2) 256) 254) (<= 16383 .cse0) .cse1 .cse2 .cse3 .cse4 (or (and (or (and .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ (* (div .cse10 .cse11) .cse12) 1) .cse13) .cse14 .cse15) (and .cse5 .cse6 .cse7 .cse8 .cse9 (= .cse10 .cse13) .cse14 .cse15)) .cse16 .cse17) (and (= .cse18 (+ .cse19 .cse10)) .cse20 .cse16 .cse17)) (<= (mod (select (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|) 0) 256) 254) .cse21 .cse22 .cse23 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base) .cse24 .cse25 .cse26 .cse27 .cse28 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) .cse29) (and .cse1 .cse2 .cse3 .cse4 (<= 16383 (mod (select .cse30 4) 65536)) .cse31 .cse21 (= (+ .cse0 .cse10) .cse18) .cse22 .cse23 .cse32 .cse24 .cse20 .cse33 .cse25 .cse26 .cse27 .cse28 .cse16 .cse17 (<= .cse10 254) .cse29) (and .cse5 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8))) (<= (+ (* (div 10 .cse11) .cse12) 1) .cse13) .cse1 .cse2 .cse3 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base))) .cse4 .cse34 (= .cse35 10) .cse31 .cse21 .cse22 .cse23 .cse8 .cse32 .cse24 (<= 16383 (mod (select .cse30 2) 65536)) .cse33 .cse25 .cse26 .cse27 .cse28 .cse16 .cse17 .cse15 .cse29))))))) [2023-12-19 15:25:39,107 INFO L899 garLoopResultBuilder]: For program point L117-1(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,107 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-19 15:25:39,107 INFO L899 garLoopResultBuilder]: For program point L117-3(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,107 INFO L899 garLoopResultBuilder]: For program point L117-5(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,107 INFO L899 garLoopResultBuilder]: For program point L117-6(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,107 INFO L899 garLoopResultBuilder]: For program point L117-7(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse26 (select |#memory_int#4| 7)) (.cse25 (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|))) (let ((.cse0 (= 8 ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset)) (.cse1 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 8)))) (.cse2 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset 2)) (.cse3 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset 0)) (.cse4 (or (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset 0)) (not (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base)))) (.cse5 (= |~#unsigned_char_Array_0~0.offset| 0)) (.cse6 (= (select .cse25 4) |ULTIMATE.start_updateVariables_#t~mem62#1|)) (.cse8 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (not (= (mod (select .cse26 3) 256) 0))) (.cse11 (= 3 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.offset)) (.cse12 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse13 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base)) (.cse14 (<= (mod (select .cse26 0) 256) 254)) (.cse15 (= |~#unsigned_short_int_Array_0~0.base| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.base)) (.cse16 (= 7 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0.base)) (.cse17 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse18 (= |~#unsigned_short_int_Array_0~0.offset| 0)) (.cse19 (= 7 |~#unsigned_char_Array_0~0.base|)) (.cse20 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse21 (= 2 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse22 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base |~#unsigned_short_int_Array_0~0.base|)) (.cse7 (select .cse26 2)) (.cse23 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset 0)) (.cse24 (= ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0.offset 4))) (or (let ((.cse10 (mod (select .cse25 2) 65536))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 10) .cse8 .cse9 (<= .cse10 32767) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 16383 .cse10) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= (+ (select (select |#memory_int#2| ~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) 4) 0) .cse22 (<= (mod .cse7 256) 254) .cse23 .cse24)))) [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-8(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-9(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-11(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-13(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-15(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-17(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-18(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,108 INFO L899 garLoopResultBuilder]: For program point L117-19(line 117) no Hoare annotation was computed. [2023-12-19 15:25:39,111 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] [2023-12-19 15:25:39,112 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:25:39,129 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base][2] could not be translated [2023-12-19 15:25:39,132 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,133 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,133 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,133 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated [2023-12-19 15:25:39,133 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated [2023-12-19 15:25:39,133 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated [2023-12-19 15:25:39,134 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated [2023-12-19 15:25:39,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0!base][3] could not be translated [2023-12-19 15:25:39,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][0] could not be translated [2023-12-19 15:25:39,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-19 15:25:39,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated [2023-12-19 15:25:39,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated [2023-12-19 15:25:39,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated [2023-12-19 15:25:39,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-19 15:25:39,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][2] could not be translated [2023-12-19 15:25:39,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][4] could not be translated [2023-12-19 15:25:39,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated [2023-12-19 15:25:39,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated [2023-12-19 15:25:39,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated [2023-12-19 15:25:39,141 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated [2023-12-19 15:25:39,141 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,141 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,141 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated [2023-12-19 15:25:39,141 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,142 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base][2] could not be translated [2023-12-19 15:25:39,142 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,142 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,142 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0!base][3] could not be translated [2023-12-19 15:25:39,142 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,142 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][0] could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated [2023-12-19 15:25:39,143 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated [2023-12-19 15:25:39,144 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated [2023-12-19 15:25:39,145 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated [2023-12-19 15:25:39,145 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated [2023-12-19 15:25:39,145 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated [2023-12-19 15:25:39,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:25:39 BoogieIcfgContainer [2023-12-19 15:25:39,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:25:39,146 INFO L158 Benchmark]: Toolchain (without parser) took 338524.90ms. Allocated memory was 181.4MB in the beginning and 679.5MB in the end (delta: 498.1MB). Free memory was 133.5MB in the beginning and 483.1MB in the end (delta: -349.7MB). Peak memory consumption was 406.6MB. Max. memory is 8.0GB. [2023-12-19 15:25:39,146 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 181.4MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:25:39,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.51ms. Allocated memory is still 181.4MB. Free memory was 133.1MB in the beginning and 117.6MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 15:25:39,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.46ms. Allocated memory is still 181.4MB. Free memory was 117.6MB in the beginning and 113.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:25:39,147 INFO L158 Benchmark]: Boogie Preprocessor took 80.14ms. Allocated memory is still 181.4MB. Free memory was 113.2MB in the beginning and 108.3MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:25:39,147 INFO L158 Benchmark]: RCFGBuilder took 639.64ms. Allocated memory is still 181.4MB. Free memory was 108.3MB in the beginning and 128.3MB in the end (delta: -20.0MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. [2023-12-19 15:25:39,147 INFO L158 Benchmark]: TraceAbstraction took 337425.17ms. Allocated memory was 181.4MB in the beginning and 679.5MB in the end (delta: 498.1MB). Free memory was 127.7MB in the beginning and 483.1MB in the end (delta: -355.4MB). Peak memory consumption was 400.2MB. Max. memory is 8.0GB. [2023-12-19 15:25:39,148 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.59ms. Allocated memory is still 181.4MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.51ms. Allocated memory is still 181.4MB. Free memory was 133.1MB in the beginning and 117.6MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.46ms. Allocated memory is still 181.4MB. Free memory was 117.6MB in the beginning and 113.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.14ms. Allocated memory is still 181.4MB. Free memory was 113.2MB in the beginning and 108.3MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 639.64ms. Allocated memory is still 181.4MB. Free memory was 108.3MB in the beginning and 128.3MB in the end (delta: -20.0MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. * TraceAbstraction took 337425.17ms. Allocated memory was 181.4MB in the beginning and 679.5MB in the end (delta: 498.1MB). Free memory was 127.7MB in the beginning and 483.1MB in the end (delta: -355.4MB). Peak memory consumption was 400.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base][~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#unsigned_char_Array_0~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_445 : int, v_ArrVal_444 : int :: #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base := #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0!base][8 := v_ArrVal_444]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0 := v_ArrVal_445]][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0!offset] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~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] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 337.3s, OverallIterations: 27, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 198.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3399 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3397 mSDsluCounter, 16454 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13040 mSDsCounter, 768 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15249 IncrementalHoareTripleChecker+Invalid, 16017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 768 mSolverCounterUnsat, 3414 mSDtfsCounter, 15249 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5216 GetRequests, 4631 SyntacticMatches, 16 SemanticMatches, 569 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10036 ImplicationChecksByTransitivity, 68.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=21, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 961 PreInvPairs, 1095 NumberOfFragments, 9502 HoareAnnotationTreeSize, 961 FormulaSimplifications, 541511 FormulaSimplificationTreeSizeReduction, 54.6s HoareSimplificationTime, 22 FormulaSimplificationsInter, 1010541 FormulaSimplificationTreeSizeReductionInter, 143.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 88.9s InterpolantComputationTime, 4321 NumberOfCodeBlocks, 4321 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4599 ConstructedInterpolants, 5 QuantifiedInterpolants, 58012 SizeOfPredicates, 380 NumberOfNonLiveVariables, 14964 ConjunctsInSsa, 829 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 21467/25228 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-19 15:25:39,363 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-19 15:25:39,405 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 Received shutdown request...