./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:07:33,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:07:33,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:07:33,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:07:33,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:07:33,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:07:33,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:07:33,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:07:33,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:07:33,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:07:33,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:07:33,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:07:33,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:07:33,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:07:33,831 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:07:33,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:07:33,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:07:33,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:07:33,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:07:33,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:07:33,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:07:33,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:07:33,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:07:33,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:07:33,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:07:33,838 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:07:33,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:07:33,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:07:33,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:07:33,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:07:33,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:07:33,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:07:33,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:07:33,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:07:33,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:33,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:07:33,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:07:33,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:07:33,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:07:33,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:07:33,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:07:33,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:07:33,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:07:33,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:07:33,843 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2024-10-14 20:07:34,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:07:34,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:07:34,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:07:34,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:07:34,123 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:07:34,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-14 20:07:35,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:07:35,750 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:07:35,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-14 20:07:35,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8333147b/0dd06cfc4b2246d18a77c1f320044c7e/FLAGbda54c275 [2024-10-14 20:07:35,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8333147b/0dd06cfc4b2246d18a77c1f320044c7e [2024-10-14 20:07:35,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:07:35,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:07:35,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:35,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:07:35,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:07:35,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:35" (1/1) ... [2024-10-14 20:07:35,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471b5ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:35, skipping insertion in model container [2024-10-14 20:07:35,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:35" (1/1) ... [2024-10-14 20:07:35,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:07:36,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:36,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:07:36,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:36,138 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:07:36,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36 WrapperNode [2024-10-14 20:07:36,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:36,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:36,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:07:36,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:07:36,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,196 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 649 [2024-10-14 20:07:36,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:36,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:07:36,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:07:36,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:07:36,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:07:36,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:07:36,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:07:36,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:07:36,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:07:36,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (1/1) ... [2024-10-14 20:07:36,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:36,303 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) [2024-10-14 20:07:36,307 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 [2024-10-14 20:07:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:07:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:07:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:07:36,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:07:36,463 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:07:36,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:07:36,487 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 20:07:37,070 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-10-14 20:07:37,071 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-10-14 20:07:37,119 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-10-14 20:07:37,119 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:07:37,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:07:37,167 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:07:37,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:37 BoogieIcfgContainer [2024-10-14 20:07:37,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:07:37,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:07:37,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:07:37,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:07:37,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:07:35" (1/3) ... [2024-10-14 20:07:37,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d17521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:37, skipping insertion in model container [2024-10-14 20:07:37,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:36" (2/3) ... [2024-10-14 20:07:37,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d17521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:37, skipping insertion in model container [2024-10-14 20:07:37,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:37" (3/3) ... [2024-10-14 20:07:37,178 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-10-14 20:07:37,193 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:07:37,193 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 20:07:37,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:07:37,283 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@471d4ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:07:37,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 20:07:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 162 states have (on average 1.7654320987654322) internal successors, (286), 166 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:37,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:37,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:37,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:37,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1887445825, now seen corresponding path program 1 times [2024-10-14 20:07:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:37,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719575396] [2024-10-14 20:07:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:37,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719575396] [2024-10-14 20:07:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719575396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:37,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:37,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772204602] [2024-10-14 20:07:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:37,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:37,635 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.7654320987654322) internal successors, (286), 166 states have internal predecessors, (286), 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:37,898 INFO L93 Difference]: Finished difference Result 377 states and 656 transitions. [2024-10-14 20:07:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 20:07:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:37,908 INFO L225 Difference]: With dead ends: 377 [2024-10-14 20:07:37,908 INFO L226 Difference]: Without dead ends: 196 [2024-10-14 20:07:37,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:37,915 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 88 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:37,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 404 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:07:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-14 20:07:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-14 20:07:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.53125) internal successors, (294), 195 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2024-10-14 20:07:37,955 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 16 [2024-10-14 20:07:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:37,955 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2024-10-14 20:07:37,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2024-10-14 20:07:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:07:37,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:37,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:37,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:07:37,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:37,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1213069940, now seen corresponding path program 1 times [2024-10-14 20:07:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580026606] [2024-10-14 20:07:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580026606] [2024-10-14 20:07:38,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580026606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:38,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:38,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:38,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175238448] [2024-10-14 20:07:38,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:38,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:38,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:38,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:38,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,079 INFO L87 Difference]: Start difference. First operand 196 states and 294 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:38,251 INFO L93 Difference]: Finished difference Result 451 states and 685 transitions. [2024-10-14 20:07:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:38,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 20:07:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:38,254 INFO L225 Difference]: With dead ends: 451 [2024-10-14 20:07:38,256 INFO L226 Difference]: Without dead ends: 255 [2024-10-14 20:07:38,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,258 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:38,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 299 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:07:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-14 20:07:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2024-10-14 20:07:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 239 states have (on average 1.5481171548117154) internal successors, (370), 242 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2024-10-14 20:07:38,287 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 19 [2024-10-14 20:07:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:38,287 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2024-10-14 20:07:38,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2024-10-14 20:07:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 20:07:38,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:38,288 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-10-14 20:07:38,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:07:38,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:38,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash 3125366, now seen corresponding path program 1 times [2024-10-14 20:07:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602330665] [2024-10-14 20:07:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:38,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602330665] [2024-10-14 20:07:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602330665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:38,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404985688] [2024-10-14 20:07:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,394 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:38,571 INFO L93 Difference]: Finished difference Result 515 states and 796 transitions. [2024-10-14 20:07:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2024-10-14 20:07:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:38,574 INFO L225 Difference]: With dead ends: 515 [2024-10-14 20:07:38,575 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 20:07:38,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,579 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 81 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:38,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 319 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:07:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 20:07:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-14 20:07:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.5482625482625483) internal successors, (401), 262 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2024-10-14 20:07:38,591 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 31 [2024-10-14 20:07:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:38,591 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2024-10-14 20:07:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2024-10-14 20:07:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:07:38,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:38,593 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-14 20:07:38,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:07:38,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1688936170, now seen corresponding path program 1 times [2024-10-14 20:07:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670235915] [2024-10-14 20:07:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:38,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:38,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670235915] [2024-10-14 20:07:38,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670235915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370529659] [2024-10-14 20:07:38,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:38,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:38,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,735 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:38,893 INFO L93 Difference]: Finished difference Result 545 states and 835 transitions. [2024-10-14 20:07:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) Word has length 45 [2024-10-14 20:07:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:38,895 INFO L225 Difference]: With dead ends: 545 [2024-10-14 20:07:38,895 INFO L226 Difference]: Without dead ends: 295 [2024-10-14 20:07:38,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,897 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 50 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:38,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 336 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-14 20:07:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 282. [2024-10-14 20:07:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 278 states have (on average 1.5071942446043165) internal successors, (419), 281 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 419 transitions. [2024-10-14 20:07:38,908 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 419 transitions. Word has length 45 [2024-10-14 20:07:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:38,909 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 419 transitions. [2024-10-14 20:07:38,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 419 transitions. [2024-10-14 20:07:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 20:07:38,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:38,910 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2024-10-14 20:07:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:07:38,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash 787909413, now seen corresponding path program 1 times [2024-10-14 20:07:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:38,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7353596] [2024-10-14 20:07:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:07:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:38,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7353596] [2024-10-14 20:07:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7353596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:38,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:38,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297208046] [2024-10-14 20:07:38,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:38,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:38,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:38,977 INFO L87 Difference]: Start difference. First operand 282 states and 419 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:39,120 INFO L93 Difference]: Finished difference Result 593 states and 888 transitions. [2024-10-14 20:07:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) Word has length 51 [2024-10-14 20:07:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:39,122 INFO L225 Difference]: With dead ends: 593 [2024-10-14 20:07:39,122 INFO L226 Difference]: Without dead ends: 321 [2024-10-14 20:07:39,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,124 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 81 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:39,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 299 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-14 20:07:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-14 20:07:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 317 states have (on average 1.5173501577287065) internal successors, (481), 320 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 481 transitions. [2024-10-14 20:07:39,134 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 481 transitions. Word has length 51 [2024-10-14 20:07:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:39,135 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 481 transitions. [2024-10-14 20:07:39,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 481 transitions. [2024-10-14 20:07:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 20:07:39,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:39,137 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:39,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:07:39,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1696173613, now seen corresponding path program 1 times [2024-10-14 20:07:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:39,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189452704] [2024-10-14 20:07:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:07:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189452704] [2024-10-14 20:07:39,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189452704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:39,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:39,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893535548] [2024-10-14 20:07:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:39,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:39,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:39,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,213 INFO L87 Difference]: Start difference. First operand 321 states and 481 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:39,377 INFO L93 Difference]: Finished difference Result 681 states and 1027 transitions. [2024-10-14 20:07:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:39,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) Word has length 79 [2024-10-14 20:07:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:39,383 INFO L225 Difference]: With dead ends: 681 [2024-10-14 20:07:39,384 INFO L226 Difference]: Without dead ends: 373 [2024-10-14 20:07:39,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,385 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 37 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:39,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 380 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-14 20:07:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 368. [2024-10-14 20:07:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 364 states have (on average 1.4368131868131868) internal successors, (523), 367 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 523 transitions. [2024-10-14 20:07:39,403 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 523 transitions. Word has length 79 [2024-10-14 20:07:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:39,403 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 523 transitions. [2024-10-14 20:07:39,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 523 transitions. [2024-10-14 20:07:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 20:07:39,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:39,410 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:39,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:07:39,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:39,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1944320107, now seen corresponding path program 1 times [2024-10-14 20:07:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682712187] [2024-10-14 20:07:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:07:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682712187] [2024-10-14 20:07:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682712187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128066513] [2024-10-14 20:07:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,482 INFO L87 Difference]: Start difference. First operand 368 states and 523 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:39,593 INFO L93 Difference]: Finished difference Result 745 states and 1055 transitions. [2024-10-14 20:07:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) Word has length 79 [2024-10-14 20:07:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:39,597 INFO L225 Difference]: With dead ends: 745 [2024-10-14 20:07:39,597 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 20:07:39,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,599 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:39,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 400 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 20:07:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-14 20:07:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 386 states have (on average 1.4248704663212435) internal successors, (550), 389 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 550 transitions. [2024-10-14 20:07:39,610 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 550 transitions. Word has length 79 [2024-10-14 20:07:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:39,610 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 550 transitions. [2024-10-14 20:07:39,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 550 transitions. [2024-10-14 20:07:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 20:07:39,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:39,613 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:07:39,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1417813202, now seen corresponding path program 1 times [2024-10-14 20:07:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334032268] [2024-10-14 20:07:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-14 20:07:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334032268] [2024-10-14 20:07:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334032268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:39,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510235673] [2024-10-14 20:07:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:39,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,707 INFO L87 Difference]: Start difference. First operand 390 states and 550 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:39,868 INFO L93 Difference]: Finished difference Result 771 states and 1086 transitions. [2024-10-14 20:07:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:39,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 90 [2024-10-14 20:07:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:39,871 INFO L225 Difference]: With dead ends: 771 [2024-10-14 20:07:39,872 INFO L226 Difference]: Without dead ends: 393 [2024-10-14 20:07:39,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,873 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 82 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:39,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 296 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-14 20:07:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-10-14 20:07:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.4190231362467867) internal successors, (552), 392 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 552 transitions. [2024-10-14 20:07:39,885 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 552 transitions. Word has length 90 [2024-10-14 20:07:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:39,886 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 552 transitions. [2024-10-14 20:07:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 552 transitions. [2024-10-14 20:07:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 20:07:39,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:39,887 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:07:39,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1481303144, now seen corresponding path program 1 times [2024-10-14 20:07:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124938356] [2024-10-14 20:07:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-14 20:07:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124938356] [2024-10-14 20:07:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124938356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235942668] [2024-10-14 20:07:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:39,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:39,944 INFO L87 Difference]: Start difference. First operand 393 states and 552 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:40,061 INFO L93 Difference]: Finished difference Result 797 states and 1117 transitions. [2024-10-14 20:07:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) Word has length 99 [2024-10-14 20:07:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:40,064 INFO L225 Difference]: With dead ends: 797 [2024-10-14 20:07:40,064 INFO L226 Difference]: Without dead ends: 417 [2024-10-14 20:07:40,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:40,065 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:40,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 399 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-14 20:07:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-10-14 20:07:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 413 states have (on average 1.4067796610169492) internal successors, (581), 416 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 581 transitions. [2024-10-14 20:07:40,074 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 581 transitions. Word has length 99 [2024-10-14 20:07:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:40,074 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 581 transitions. [2024-10-14 20:07:40,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 581 transitions. [2024-10-14 20:07:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 20:07:40,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:40,076 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:40,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:07:40,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:40,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1447182789, now seen corresponding path program 1 times [2024-10-14 20:07:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:40,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780721077] [2024-10-14 20:07:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-14 20:07:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:40,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780721077] [2024-10-14 20:07:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780721077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:40,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163900006] [2024-10-14 20:07:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:40,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:40,136 INFO L87 Difference]: Start difference. First operand 417 states and 581 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:40,256 INFO L93 Difference]: Finished difference Result 847 states and 1179 transitions. [2024-10-14 20:07:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:40,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) Word has length 125 [2024-10-14 20:07:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:40,258 INFO L225 Difference]: With dead ends: 847 [2024-10-14 20:07:40,258 INFO L226 Difference]: Without dead ends: 443 [2024-10-14 20:07:40,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:40,259 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:40,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 399 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-14 20:07:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-10-14 20:07:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 439 states have (on average 1.3940774487471526) internal successors, (612), 442 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 612 transitions. [2024-10-14 20:07:40,270 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 612 transitions. Word has length 125 [2024-10-14 20:07:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:40,271 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 612 transitions. [2024-10-14 20:07:40,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 612 transitions. [2024-10-14 20:07:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 20:07:40,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:40,272 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:40,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:07:40,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:40,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 616782484, now seen corresponding path program 1 times [2024-10-14 20:07:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379673530] [2024-10-14 20:07:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:40,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:40,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379673530] [2024-10-14 20:07:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379673530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:40,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:40,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754034873] [2024-10-14 20:07:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:40,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:40,342 INFO L87 Difference]: Start difference. First operand 443 states and 612 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:40,488 INFO L93 Difference]: Finished difference Result 903 states and 1241 transitions. [2024-10-14 20:07:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:40,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) Word has length 127 [2024-10-14 20:07:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:40,502 INFO L225 Difference]: With dead ends: 903 [2024-10-14 20:07:40,502 INFO L226 Difference]: Without dead ends: 473 [2024-10-14 20:07:40,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:40,504 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:40,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-14 20:07:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 456. [2024-10-14 20:07:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 452 states have (on average 1.3938053097345133) internal successors, (630), 455 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 630 transitions. [2024-10-14 20:07:40,515 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 630 transitions. Word has length 127 [2024-10-14 20:07:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:40,515 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 630 transitions. [2024-10-14 20:07:40,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 630 transitions. [2024-10-14 20:07:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 20:07:40,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:40,518 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:40,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:07:40,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:40,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1754629987, now seen corresponding path program 1 times [2024-10-14 20:07:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088380645] [2024-10-14 20:07:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 4 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088380645] [2024-10-14 20:07:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088380645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925534760] [2024-10-14 20:07:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:40,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:40,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:40,622 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) [2024-10-14 20:07:40,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:07:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:40,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:40,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 4 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:40,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 100 proven. 4 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925534760] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:40,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-14 20:07:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216642041] [2024-10-14 20:07:40,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:07:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:07:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:40,935 INFO L87 Difference]: Start difference. First operand 456 states and 630 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:41,480 INFO L93 Difference]: Finished difference Result 1864 states and 2594 transitions. [2024-10-14 20:07:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:07:41,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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) Word has length 151 [2024-10-14 20:07:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:41,486 INFO L225 Difference]: With dead ends: 1864 [2024-10-14 20:07:41,486 INFO L226 Difference]: Without dead ends: 1386 [2024-10-14 20:07:41,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:07:41,488 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 812 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:41,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 909 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:07:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-10-14 20:07:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1181. [2024-10-14 20:07:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1177 states have (on average 1.4248088360237894) internal successors, (1677), 1180 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1677 transitions. [2024-10-14 20:07:41,528 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1677 transitions. Word has length 151 [2024-10-14 20:07:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:41,528 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1677 transitions. [2024-10-14 20:07:41,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1677 transitions. [2024-10-14 20:07:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 20:07:41,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:41,531 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:41,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:07:41,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 20:07:41,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:41,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 161319698, now seen corresponding path program 1 times [2024-10-14 20:07:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258023948] [2024-10-14 20:07:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:41,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258023948] [2024-10-14 20:07:41,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258023948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:41,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107202585] [2024-10-14 20:07:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:41,817 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) [2024-10-14 20:07:41,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:07:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:41,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:41,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:41,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 20:07:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107202585] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:42,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-14 20:07:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829094967] [2024-10-14 20:07:42,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:07:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:07:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:42,070 INFO L87 Difference]: Start difference. First operand 1181 states and 1677 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:42,652 INFO L93 Difference]: Finished difference Result 3361 states and 4690 transitions. [2024-10-14 20:07:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:07:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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) Word has length 154 [2024-10-14 20:07:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:42,660 INFO L225 Difference]: With dead ends: 3361 [2024-10-14 20:07:42,660 INFO L226 Difference]: Without dead ends: 2193 [2024-10-14 20:07:42,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:07:42,663 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 548 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:42,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1317 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:07:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2024-10-14 20:07:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1878. [2024-10-14 20:07:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1874 states have (on average 1.3815368196371398) internal successors, (2589), 1877 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2589 transitions. [2024-10-14 20:07:42,740 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2589 transitions. Word has length 154 [2024-10-14 20:07:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2589 transitions. [2024-10-14 20:07:42,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2589 transitions. [2024-10-14 20:07:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 20:07:42,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:42,743 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:42,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 20:07:42,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 20:07:42,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1110971422, now seen corresponding path program 1 times [2024-10-14 20:07:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491335292] [2024-10-14 20:07:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-14 20:07:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491335292] [2024-10-14 20:07:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491335292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:43,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472134049] [2024-10-14 20:07:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:43,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,026 INFO L87 Difference]: Start difference. First operand 1878 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:43,075 INFO L93 Difference]: Finished difference Result 4867 states and 6713 transitions. [2024-10-14 20:07:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:43,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) Word has length 162 [2024-10-14 20:07:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:43,084 INFO L225 Difference]: With dead ends: 4867 [2024-10-14 20:07:43,085 INFO L226 Difference]: Without dead ends: 3002 [2024-10-14 20:07:43,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,087 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 172 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:43,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 648 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2024-10-14 20:07:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2766. [2024-10-14 20:07:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2762 states have (on average 1.3852280955829108) internal successors, (3826), 2765 states have internal predecessors, (3826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3826 transitions. [2024-10-14 20:07:43,143 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3826 transitions. Word has length 162 [2024-10-14 20:07:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:43,144 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 3826 transitions. [2024-10-14 20:07:43,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3826 transitions. [2024-10-14 20:07:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 20:07:43,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:43,146 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:43,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 20:07:43,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:43,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:43,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1616888393, now seen corresponding path program 1 times [2024-10-14 20:07:43,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:43,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278270486] [2024-10-14 20:07:43,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 20:07:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278270486] [2024-10-14 20:07:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278270486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:43,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139114658] [2024-10-14 20:07:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:43,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,212 INFO L87 Difference]: Start difference. First operand 2766 states and 3826 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:43,377 INFO L93 Difference]: Finished difference Result 5060 states and 6953 transitions. [2024-10-14 20:07:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) Word has length 162 [2024-10-14 20:07:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:43,384 INFO L225 Difference]: With dead ends: 5060 [2024-10-14 20:07:43,384 INFO L226 Difference]: Without dead ends: 2307 [2024-10-14 20:07:43,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,387 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 9 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:43,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 389 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2024-10-14 20:07:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1597. [2024-10-14 20:07:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 1.342319749216301) internal successors, (2141), 1596 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2141 transitions. [2024-10-14 20:07:43,423 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2141 transitions. Word has length 162 [2024-10-14 20:07:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:43,424 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2141 transitions. [2024-10-14 20:07:43,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2141 transitions. [2024-10-14 20:07:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 20:07:43,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:43,426 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:43,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 20:07:43,427 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 681790815, now seen corresponding path program 1 times [2024-10-14 20:07:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325857963] [2024-10-14 20:07:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-10-14 20:07:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325857963] [2024-10-14 20:07:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325857963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146732523] [2024-10-14 20:07:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,498 INFO L87 Difference]: Start difference. First operand 1597 states and 2141 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:43,632 INFO L93 Difference]: Finished difference Result 3170 states and 4243 transitions. [2024-10-14 20:07:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:43,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) Word has length 194 [2024-10-14 20:07:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:43,637 INFO L225 Difference]: With dead ends: 3170 [2024-10-14 20:07:43,637 INFO L226 Difference]: Without dead ends: 1584 [2024-10-14 20:07:43,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,639 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 62 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:43,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 340 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-10-14 20:07:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1504. [2024-10-14 20:07:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1502 states have (on average 1.3268974700399467) internal successors, (1993), 1503 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1993 transitions. [2024-10-14 20:07:43,670 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1993 transitions. Word has length 194 [2024-10-14 20:07:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:43,671 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1993 transitions. [2024-10-14 20:07:43,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1993 transitions. [2024-10-14 20:07:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 20:07:43,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:43,673 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 20:07:43,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:43,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1847824162, now seen corresponding path program 1 times [2024-10-14 20:07:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597037975] [2024-10-14 20:07:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-14 20:07:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597037975] [2024-10-14 20:07:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597037975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385269981] [2024-10-14 20:07:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:43,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,768 INFO L87 Difference]: Start difference. First operand 1504 states and 1993 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:43,909 INFO L93 Difference]: Finished difference Result 2612 states and 3421 transitions. [2024-10-14 20:07:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) Word has length 199 [2024-10-14 20:07:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:43,912 INFO L225 Difference]: With dead ends: 2612 [2024-10-14 20:07:43,912 INFO L226 Difference]: Without dead ends: 674 [2024-10-14 20:07:43,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:43,914 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 28 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:43,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 390 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-10-14 20:07:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 572. [2024-10-14 20:07:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 570 states have (on average 1.3157894736842106) internal successors, (750), 571 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 750 transitions. [2024-10-14 20:07:43,926 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 750 transitions. Word has length 199 [2024-10-14 20:07:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:43,926 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 750 transitions. [2024-10-14 20:07:43,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 750 transitions. [2024-10-14 20:07:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-14 20:07:43,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:43,929 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 20:07:43,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:43,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1361748228, now seen corresponding path program 1 times [2024-10-14 20:07:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408190285] [2024-10-14 20:07:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-14 20:07:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408190285] [2024-10-14 20:07:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408190285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431848915] [2024-10-14 20:07:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,024 INFO L87 Difference]: Start difference. First operand 572 states and 750 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,134 INFO L93 Difference]: Finished difference Result 1164 states and 1520 transitions. [2024-10-14 20:07:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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) Word has length 292 [2024-10-14 20:07:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,137 INFO L225 Difference]: With dead ends: 1164 [2024-10-14 20:07:44,137 INFO L226 Difference]: Without dead ends: 605 [2024-10-14 20:07:44,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,139 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-14 20:07:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-10-14 20:07:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 603 states have (on average 1.306799336650083) internal successors, (788), 604 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 788 transitions. [2024-10-14 20:07:44,151 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 788 transitions. Word has length 292 [2024-10-14 20:07:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,152 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 788 transitions. [2024-10-14 20:07:44,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 788 transitions. [2024-10-14 20:07:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-14 20:07:44,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,155 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 20:07:44,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -598744524, now seen corresponding path program 1 times [2024-10-14 20:07:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145812090] [2024-10-14 20:07:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2024-10-14 20:07:44,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145812090] [2024-10-14 20:07:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145812090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783847782] [2024-10-14 20:07:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,248 INFO L87 Difference]: Start difference. First operand 605 states and 788 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,361 INFO L93 Difference]: Finished difference Result 1232 states and 1600 transitions. [2024-10-14 20:07:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) Word has length 322 [2024-10-14 20:07:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,364 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 20:07:44,364 INFO L226 Difference]: Without dead ends: 640 [2024-10-14 20:07:44,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,365 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-14 20:07:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2024-10-14 20:07:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 638 states have (on average 1.297805642633229) internal successors, (828), 639 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 828 transitions. [2024-10-14 20:07:44,377 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 828 transitions. Word has length 322 [2024-10-14 20:07:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,378 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 828 transitions. [2024-10-14 20:07:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 828 transitions. [2024-10-14 20:07:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-10-14 20:07:44,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,382 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 20:07:44,383 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1442154777, now seen corresponding path program 1 times [2024-10-14 20:07:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411960594] [2024-10-14 20:07:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-10-14 20:07:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411960594] [2024-10-14 20:07:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411960594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519034029] [2024-10-14 20:07:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,496 INFO L87 Difference]: Start difference. First operand 640 states and 828 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,609 INFO L93 Difference]: Finished difference Result 1266 states and 1633 transitions. [2024-10-14 20:07:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) Word has length 354 [2024-10-14 20:07:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,612 INFO L225 Difference]: With dead ends: 1266 [2024-10-14 20:07:44,612 INFO L226 Difference]: Without dead ends: 639 [2024-10-14 20:07:44,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,614 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 377 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-14 20:07:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-10-14 20:07:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 637 states have (on average 1.2857142857142858) internal successors, (819), 638 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 819 transitions. [2024-10-14 20:07:44,627 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 819 transitions. Word has length 354 [2024-10-14 20:07:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,627 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 819 transitions. [2024-10-14 20:07:44,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 819 transitions. [2024-10-14 20:07:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-10-14 20:07:44,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,632 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 20:07:44,633 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1184719713, now seen corresponding path program 1 times [2024-10-14 20:07:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430389533] [2024-10-14 20:07:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 913 proven. 0 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2024-10-14 20:07:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430389533] [2024-10-14 20:07:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430389533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103968485] [2024-10-14 20:07:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,788 INFO L87 Difference]: Start difference. First operand 639 states and 819 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,825 INFO L93 Difference]: Finished difference Result 1684 states and 2135 transitions. [2024-10-14 20:07:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) Word has length 391 [2024-10-14 20:07:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,829 INFO L225 Difference]: With dead ends: 1684 [2024-10-14 20:07:44,829 INFO L226 Difference]: Without dead ends: 1058 [2024-10-14 20:07:44,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,831 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 94 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 464 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-14 20:07:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2024-10-14 20:07:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1056 states have (on average 1.262310606060606) internal successors, (1333), 1057 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1333 transitions. [2024-10-14 20:07:44,873 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1333 transitions. Word has length 391 [2024-10-14 20:07:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,874 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1333 transitions. [2024-10-14 20:07:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1333 transitions. [2024-10-14 20:07:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-10-14 20:07:44,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,880 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 20:07:44,881 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:07:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 750214115, now seen corresponding path program 1 times [2024-10-14 20:07:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923563164] [2024-10-14 20:07:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 329 proven. 6 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2024-10-14 20:07:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923563164] [2024-10-14 20:07:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923563164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699253466] [2024-10-14 20:07:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:45,077 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) [2024-10-14 20:07:45,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:07:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:45,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 329 proven. 6 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2024-10-14 20:07:45,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 329 proven. 6 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2024-10-14 20:07:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699253466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:45,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:45,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-14 20:07:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734607653] [2024-10-14 20:07:45,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:45,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 20:07:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 20:07:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:07:45,346 INFO L87 Difference]: Start difference. First operand 1058 states and 1333 transitions. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:45,603 INFO L93 Difference]: Finished difference Result 2346 states and 2959 transitions. [2024-10-14 20:07:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 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) Word has length 391 [2024-10-14 20:07:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:45,604 INFO L225 Difference]: With dead ends: 2346 [2024-10-14 20:07:45,604 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:07:45,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:07:45,608 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 241 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:45,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1203 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:07:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:07:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:07:45,609 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) [2024-10-14 20:07:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:07:45,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 391 [2024-10-14 20:07:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:45,610 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:07:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:07:45,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:07:45,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 20:07:45,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 20:07:45,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 20:07:45,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 20:07:45,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:07:45,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:45,818 INFO L407 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] [2024-10-14 20:07:45,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:07:46,949 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:07:46,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:07:46 BoogieIcfgContainer [2024-10-14 20:07:46,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:07:46,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:07:46,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:07:46,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:07:46,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:37" (3/4) ... [2024-10-14 20:07:46,980 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:07:46,997 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 20:07:46,999 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:07:47,000 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:07:47,001 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:07:47,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:07:47,150 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:07:47,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:07:47,150 INFO L158 Benchmark]: Toolchain (without parser) took 11360.71ms. Allocated memory was 146.8MB in the beginning and 283.1MB in the end (delta: 136.3MB). Free memory was 99.5MB in the beginning and 174.6MB in the end (delta: -75.1MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,150 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:07:47,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.09ms. Allocated memory is still 146.8MB. Free memory was 99.1MB in the beginning and 82.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.13ms. Allocated memory is still 146.8MB. Free memory was 82.3MB in the beginning and 79.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,151 INFO L158 Benchmark]: Boogie Preprocessor took 73.39ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 75.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,151 INFO L158 Benchmark]: RCFGBuilder took 896.68ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 75.2MB in the beginning and 136.0MB in the end (delta: -60.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,151 INFO L158 Benchmark]: TraceAbstraction took 9806.16ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 135.0MB in the beginning and 185.0MB in the end (delta: -50.1MB). Peak memory consumption was 144.5MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,152 INFO L158 Benchmark]: Witness Printer took 172.80ms. Allocated memory is still 283.1MB. Free memory was 185.0MB in the beginning and 174.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:07:47,155 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.09ms. Allocated memory is still 146.8MB. Free memory was 99.1MB in the beginning and 82.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.13ms. Allocated memory is still 146.8MB. Free memory was 82.3MB in the beginning and 79.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.39ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 75.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 896.68ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 75.2MB in the beginning and 136.0MB in the end (delta: -60.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9806.16ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 135.0MB in the beginning and 185.0MB in the end (delta: -50.1MB). Peak memory consumption was 144.5MB. Max. memory is 16.1GB. * Witness Printer took 172.80ms. Allocated memory is still 283.1MB. Free memory was 185.0MB in the beginning and 174.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * 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: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 167 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 22, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2593 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2593 mSDsluCounter, 10630 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5151 mSDsCounter, 449 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3813 IncrementalHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 449 mSolverCounterUnsat, 5479 mSDtfsCounter, 3813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1471 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2766occurred in iteration=14, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1695 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 4229 NumberOfCodeBlocks, 4229 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4897 ConstructedInterpolants, 0 QuantifiedInterpolants, 6706 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1265 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 28 InterpolantComputations, 19 PerfectInterpolantSequences, 13148/13196 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 4 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((s__state == 8528) || ((s__s3__tmp__next_state___0 <= 8576) && (s__state == 8640))) || ((((8464 <= s__state) && (s__state <= 8466)) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || (8496 == s__state)) || ((8576 == s__s3__tmp__next_state___0) && (8576 == s__state))) || ((s__state == 8592) && (s__s3__tmp__next_state___0 <= 8576))) || (8560 == s__state)) || ((s__state == 8608) && (s__s3__tmp__next_state___0 <= 8576))) || (((s__state <= 8464) && (3 == s__s3__tmp__next_state___0)) && (8448 <= s__state))) || (((((s__state <= 12291) && (8576 <= s__s3__tmp__next_state___0)) && (0 != s__hit)) && (8576 <= s__state)) && (s__s3__tmp__next_state___0 <= 12291))) || (s__state == 8512)) || ((s__state == 3) && (s__s3__tmp__next_state___0 <= 8576))) || (((((s__state <= 8464) && (8576 <= s__s3__tmp__next_state___0)) && (8448 <= s__state)) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || (((s__state <= 8464) && (8576 == s__s3__tmp__next_state___0)) && (8448 <= s__state))) || (8464 == s__state)) || (((s__state == 3) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || ((8656 <= s__state) && (s__state <= 8672))) || (((8464 <= s__state) && (s__state <= 8466)) && (s__s3__tmp__next_state___0 <= 8576))) || (8544 == s__state)) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:07:47,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE