./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condn.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condn.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d395fadb914a95d9511046d910130b84077290c26c4e0d02bd3863b898526b50 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:09:04,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:09:04,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:09:04,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:09:04,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:09:04,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:09:04,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:09:04,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:09:04,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:09:04,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:09:04,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:09:04,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:09:04,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:09:04,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:09:04,944 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:09:04,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:09:04,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:09:04,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:09:04,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:09:04,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:09:04,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:09:04,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:09:04,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:09:04,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:09:04,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:09:04,950 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:09:04,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:09:04,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:09:04,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:09:04,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:09:04,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:09:04,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:09:04,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:09:04,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:09:04,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:09:04,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:09:04,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:09:04,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:09:04,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:09:04,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:09:04,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:09:04,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:09:04,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:09:04,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:09:04,958 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-clean/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-clean/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 -> d395fadb914a95d9511046d910130b84077290c26c4e0d02bd3863b898526b50 [2024-10-11 20:09:05,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:09:05,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:09:05,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:09:05,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:09:05,246 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:09:05,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condn.c [2024-10-11 20:09:06,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:09:06,873 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:09:06,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condn.c [2024-10-11 20:09:06,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26cd440d4/b7287761f8da424db7f0aff31a6ec28d/FLAGf3fb835f7 [2024-10-11 20:09:06,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26cd440d4/b7287761f8da424db7f0aff31a6ec28d [2024-10-11 20:09:06,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:09:06,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:09:06,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:09:06,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:09:06,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:09:06,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:06" (1/1) ... [2024-10-11 20:09:06,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f80be93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:06, skipping insertion in model container [2024-10-11 20:09:06,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:06" (1/1) ... [2024-10-11 20:09:06,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:09:07,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:09:07,140 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:09:07,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:09:07,178 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:09:07,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07 WrapperNode [2024-10-11 20:09:07,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:09:07,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:09:07,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:09:07,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:09:07,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,221 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 86 [2024-10-11 20:09:07,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:09:07,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:09:07,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:09:07,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:09:07,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,265 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 8, 6]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 3 writes are split as follows [0, 0, 3]. [2024-10-11 20:09:07,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:09:07,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:09:07,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:09:07,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:09:07,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (1/1) ... [2024-10-11 20:09:07,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:09:07,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:07,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:09:07,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:09:07,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:09:07,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:09:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:09:07,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:09:07,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:09:07,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:09:07,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:09:07,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:09:07,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:09:07,576 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 20:09:07,577 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:09:07,609 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:09:07,609 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:09:07,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:07 BoogieIcfgContainer [2024-10-11 20:09:07,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:09:07,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:09:07,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:09:07,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:09:07,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:09:06" (1/3) ... [2024-10-11 20:09:07,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef06ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:07, skipping insertion in model container [2024-10-11 20:09:07,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:07" (2/3) ... [2024-10-11 20:09:07,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef06ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:07, skipping insertion in model container [2024-10-11 20:09:07,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:07" (3/3) ... [2024-10-11 20:09:07,619 INFO L112 eAbstractionObserver]: Analyzing ICFG condn.c [2024-10-11 20:09:07,638 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:09:07,639 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:09:07,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:09:07,705 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;@5861b007, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:09:07,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:09:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 27 states have internal predecessors, (37), 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-11 20:09:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:09:07,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:07,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:09:07,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:07,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash -824061137, now seen corresponding path program 1 times [2024-10-11 20:09:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119968072] [2024-10-11 20:09:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:07,894 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-11 20:09:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:07,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119968072] [2024-10-11 20:09:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119968072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227312484] [2024-10-11 20:09:07,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:07,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:09:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:09:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:09:07,929 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 27 states have internal predecessors, (37), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11 20:09:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:07,960 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-10-11 20:09:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:09:07,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-11 20:09:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:07,968 INFO L225 Difference]: With dead ends: 53 [2024-10-11 20:09:07,968 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 20:09:07,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:09:07,973 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:07,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 20:09:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 20:09:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-11 20:09:08,000 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2024-10-11 20:09:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-11 20:09:08,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11 20:09:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-11 20:09:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:09:08,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:08,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:09:08,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:09:08,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:08,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -824001555, now seen corresponding path program 1 times [2024-10-11 20:09:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:08,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258396501] [2024-10-11 20:09:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:08,153 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-11 20:09:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258396501] [2024-10-11 20:09:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258396501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836002361] [2024-10-11 20:09:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:08,157 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-11 20:09:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:08,221 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-11 20:09:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-10-11 20:09:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:08,222 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:09:08,222 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 20:09:08,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:08,224 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:08,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 20:09:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2024-10-11 20:09:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-11 20:09:08,232 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2024-10-11 20:09:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-11 20:09:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-11 20:09:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-11 20:09:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:09:08,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:08,233 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:08,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:09:08,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:08,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2092168789, now seen corresponding path program 1 times [2024-10-11 20:09:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6943230] [2024-10-11 20:09:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6943230] [2024-10-11 20:09:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6943230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099931566] [2024-10-11 20:09:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:08,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:08,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:08,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:08,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:09:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:08,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:08,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:08,545 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-11 20:09:08,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099931566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:08,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:08,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:09:08,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469497387] [2024-10-11 20:09:08,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:08,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:09:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:08,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:09:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:09:08,547 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-11 20:09:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:08,628 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-11 20:09:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:09:08,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2024-10-11 20:09:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:08,630 INFO L225 Difference]: With dead ends: 34 [2024-10-11 20:09:08,630 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 20:09:08,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:09:08,631 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:08,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 20:09:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2024-10-11 20:09:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 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-11 20:09:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-11 20:09:08,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2024-10-11 20:09:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:08,649 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-11 20:09:08,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-11 20:09:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-11 20:09:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:09:08,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:08,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:08,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:09:08,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:08,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:08,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1806797664, now seen corresponding path program 1 times [2024-10-11 20:09:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250201597] [2024-10-11 20:09:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:08,923 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-11 20:09:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250201597] [2024-10-11 20:09:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250201597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:08,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:08,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:09:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193481807] [2024-10-11 20:09:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:08,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:08,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:08,925 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:08,972 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-10-11 20:09:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:09:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:08,973 INFO L225 Difference]: With dead ends: 49 [2024-10-11 20:09:08,974 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 20:09:08,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:08,975 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:08,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 26 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 20:09:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-10-11 20:09:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 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-11 20:09:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-11 20:09:08,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2024-10-11 20:09:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:08,984 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-11 20:09:08,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-11 20:09:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:09:08,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:08,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:09:08,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -432722961, now seen corresponding path program 1 times [2024-10-11 20:09:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866748726] [2024-10-11 20:09:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866748726] [2024-10-11 20:09:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866748726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406254798] [2024-10-11 20:09:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:09,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:09,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:09,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:09,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:09:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:09,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:09,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:09,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406254798] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:09,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:09:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505584022] [2024-10-11 20:09:09,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:09:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:09:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:09,271 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:09,336 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-10-11 20:09:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:09:09,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:09:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:09,339 INFO L225 Difference]: With dead ends: 43 [2024-10-11 20:09:09,339 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 20:09:09,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:09,343 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:09,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 20:09:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-10-11 20:09:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-11 20:09:09,351 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 10 [2024-10-11 20:09:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-11 20:09:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-11 20:09:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:09:09,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:09,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:09,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:09:09,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:09,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 186763806, now seen corresponding path program 1 times [2024-10-11 20:09:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382906284] [2024-10-11 20:09:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382906284] [2024-10-11 20:09:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382906284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:09,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:09,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296120960] [2024-10-11 20:09:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:09,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:09,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:09,625 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-11 20:09:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:09,675 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-10-11 20:09:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:09,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-11 20:09:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:09,676 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:09:09,676 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 20:09:09,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:09,677 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:09,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 20:09:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-10-11 20:09:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 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-11 20:09:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-11 20:09:09,688 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 13 [2024-10-11 20:09:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:09,688 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-11 20:09:09,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-11 20:09:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-11 20:09:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:09:09,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:09,689 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:09,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:09:09,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:09,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1405864424, now seen corresponding path program 1 times [2024-10-11 20:09:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:09,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352413026] [2024-10-11 20:09:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:09,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:09,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352413026] [2024-10-11 20:09:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352413026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826568515] [2024-10-11 20:09:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:09,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:09,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:09:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:09,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:09:09,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:09,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826568515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:10,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:10,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2024-10-11 20:09:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285168699] [2024-10-11 20:09:10,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:10,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:09:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:09:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:10,076 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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-11 20:09:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:10,328 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2024-10-11 20:09:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:09:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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 18 [2024-10-11 20:09:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:10,330 INFO L225 Difference]: With dead ends: 79 [2024-10-11 20:09:10,330 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 20:09:10,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:09:10,331 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:10,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 106 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:09:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 20:09:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2024-10-11 20:09:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-11 20:09:10,338 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2024-10-11 20:09:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:10,338 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-11 20:09:10,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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-11 20:09:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-11 20:09:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:09:10,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:10,339 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2024-10-11 20:09:10,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:09:10,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:10,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:10,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -580615315, now seen corresponding path program 2 times [2024-10-11 20:09:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167058407] [2024-10-11 20:09:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167058407] [2024-10-11 20:09:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167058407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715456858] [2024-10-11 20:09:10,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:10,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:10,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:09:10,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:10,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:10,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:10,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:09:10,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:09:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715456858] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:10,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 13 [2024-10-11 20:09:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082064223] [2024-10-11 20:09:10,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:09:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:09:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:09:10,917 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-11 20:09:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:11,112 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-10-11 20:09:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:09:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-11 20:09:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:11,113 INFO L225 Difference]: With dead ends: 53 [2024-10-11 20:09:11,113 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 20:09:11,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:09:11,114 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:11,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 65 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 20:09:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2024-10-11 20:09:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 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-11 20:09:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-11 20:09:11,120 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 19 [2024-10-11 20:09:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:11,120 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-11 20:09:11,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-11 20:09:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-11 20:09:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:09:11,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:11,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:11,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:09:11,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:09:11,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:11,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1833313282, now seen corresponding path program 1 times [2024-10-11 20:09:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015972626] [2024-10-11 20:09:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:09:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015972626] [2024-10-11 20:09:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015972626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:11,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250295517] [2024-10-11 20:09:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:11,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:11,382 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:11,416 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-11 20:09:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:11,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 20:09:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:11,417 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:09:11,417 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:09:11,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:11,418 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:11,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:09:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 20:09:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 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-11 20:09:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-11 20:09:11,426 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2024-10-11 20:09:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-11 20:09:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-11 20:09:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:09:11,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:11,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:09:11,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1328937925, now seen corresponding path program 1 times [2024-10-11 20:09:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153330274] [2024-10-11 20:09:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153330274] [2024-10-11 20:09:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153330274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658535431] [2024-10-11 20:09:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:11,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:11,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:11,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:11,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:09:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:11,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:11,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:11,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658535431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:11,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:09:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219735432] [2024-10-11 20:09:11,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:11,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:09:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:09:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:11,644 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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-11 20:09:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:11,716 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-10-11 20:09:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:09:11,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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 22 [2024-10-11 20:09:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:11,717 INFO L225 Difference]: With dead ends: 59 [2024-10-11 20:09:11,719 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 20:09:11,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:11,721 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:11,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 20:09:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 20:09:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 57 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-11 20:09:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-10-11 20:09:11,729 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 22 [2024-10-11 20:09:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:11,729 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-10-11 20:09:11,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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-11 20:09:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-10-11 20:09:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:09:11,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:11,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:11,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:09:11,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:09:11,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1720974058, now seen corresponding path program 1 times [2024-10-11 20:09:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711487554] [2024-10-11 20:09:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:09:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711487554] [2024-10-11 20:09:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711487554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720429373] [2024-10-11 20:09:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:12,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:12,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:12,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:12,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:09:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:12,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:09:12,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:12,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720429373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:12,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2024-10-11 20:09:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464704758] [2024-10-11 20:09:12,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:12,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:09:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:09:12,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:12,279 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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-11 20:09:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:12,441 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-10-11 20:09:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:09:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 25 [2024-10-11 20:09:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:12,442 INFO L225 Difference]: With dead ends: 74 [2024-10-11 20:09:12,442 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 20:09:12,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:09:12,443 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:12,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 82 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 20:09:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-10-11 20:09:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 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-11 20:09:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-10-11 20:09:12,448 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 25 [2024-10-11 20:09:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-10-11 20:09:12,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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-11 20:09:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-10-11 20:09:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:09:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:12,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:12,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:09:12,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:09:12,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 758277506, now seen corresponding path program 1 times [2024-10-11 20:09:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124042930] [2024-10-11 20:09:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:09:12,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124042930] [2024-10-11 20:09:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124042930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618216788] [2024-10-11 20:09:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:12,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:12,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:12,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:09:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:12,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:09:12,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:12,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618216788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:12,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:12,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2024-10-11 20:09:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749443882] [2024-10-11 20:09:12,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:12,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:09:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:09:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:12,966 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:13,137 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-10-11 20:09:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:09:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 20:09:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:13,138 INFO L225 Difference]: With dead ends: 67 [2024-10-11 20:09:13,138 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:09:13,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:09:13,140 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:13,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 59 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:09:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 20:09:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 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-11 20:09:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-10-11 20:09:13,145 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 29 [2024-10-11 20:09:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:13,145 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-11 20:09:13,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-10-11 20:09:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:09:13,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:13,146 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:13,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:09:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:13,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 225797681, now seen corresponding path program 2 times [2024-10-11 20:09:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179985911] [2024-10-11 20:09:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 20:09:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179985911] [2024-10-11 20:09:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179985911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:13,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066534939] [2024-10-11 20:09:13,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:13,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:13,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:13,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:09:13,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:13,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:13,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:13,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 20:09:13,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 20:09:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066534939] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:13,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:13,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3] total 11 [2024-10-11 20:09:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119670969] [2024-10-11 20:09:13,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:13,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:09:13,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:09:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:13,688 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:13,878 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2024-10-11 20:09:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:09:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 20:09:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:13,879 INFO L225 Difference]: With dead ends: 101 [2024-10-11 20:09:13,879 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 20:09:13,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:09:13,880 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:13,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 43 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 20:09:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 40. [2024-10-11 20:09:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-11 20:09:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-10-11 20:09:13,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2024-10-11 20:09:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:13,888 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-11 20:09:13,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-10-11 20:09:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:09:13,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:13,889 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:13,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:09:14,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:09:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1927234972, now seen corresponding path program 2 times [2024-10-11 20:09:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:14,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088546485] [2024-10-11 20:09:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 20:09:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088546485] [2024-10-11 20:09:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088546485] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160863336] [2024-10-11 20:09:14,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:14,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:14,278 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:14,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:09:14,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:14,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:14,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:14,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:09:14,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:09:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160863336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:14,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:14,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 16 [2024-10-11 20:09:14,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033947591] [2024-10-11 20:09:14,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:14,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:09:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:14,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:09:14,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:14,474 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-11 20:09:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:14,668 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-10-11 20:09:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:09:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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 39 [2024-10-11 20:09:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:14,669 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:09:14,669 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:09:14,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:09:14,670 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:14,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 44 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:09:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:09:14,671 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-11 20:09:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:09:14,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-11 20:09:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:14,672 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:09:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-11 20:09:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:09:14,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:09:14,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 20:09:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 20:09:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 20:09:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 20:09:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 20:09:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 20:09:14,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:09:14,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:14,882 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:14,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:09:15,210 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:09:15,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:09:15 BoogieIcfgContainer [2024-10-11 20:09:15,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:09:15,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:09:15,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:09:15,229 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:09:15,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:07" (3/4) ... [2024-10-11 20:09:15,232 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:09:15,240 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 20:09:15,241 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:09:15,241 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:09:15,241 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:09:15,241 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:09:15,336 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:09:15,337 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:09:15,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:09:15,337 INFO L158 Benchmark]: Toolchain (without parser) took 8437.61ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 82.9MB in the beginning and 117.9MB in the end (delta: -35.0MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-11 20:09:15,338 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 138.4MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:09:15,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.34ms. Allocated memory is still 138.4MB. Free memory was 82.8MB in the beginning and 70.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:09:15,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.34ms. Allocated memory is still 138.4MB. Free memory was 70.3MB in the beginning and 68.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:09:15,338 INFO L158 Benchmark]: Boogie Preprocessor took 58.38ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 68.8MB in the beginning and 144.6MB in the end (delta: -75.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-10-11 20:09:15,338 INFO L158 Benchmark]: RCFGBuilder took 321.45ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 132.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:09:15,339 INFO L158 Benchmark]: TraceAbstraction took 7616.79ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 131.0MB in the beginning and 122.1MB in the end (delta: 8.9MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2024-10-11 20:09:15,339 INFO L158 Benchmark]: Witness Printer took 108.00ms. Allocated memory is still 211.8MB. Free memory was 122.1MB in the beginning and 117.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:09:15,340 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 138.4MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.34ms. Allocated memory is still 138.4MB. Free memory was 82.8MB in the beginning and 70.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.34ms. Allocated memory is still 138.4MB. Free memory was 70.3MB in the beginning and 68.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.38ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 68.8MB in the beginning and 144.6MB in the end (delta: -75.8MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * RCFGBuilder took 321.45ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 132.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7616.79ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 131.0MB in the beginning and 122.1MB in the end (delta: 8.9MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. * Witness Printer took 108.00ms. Allocated memory is still 211.8MB. Free memory was 122.1MB in the beginning and 117.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: 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, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 530 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1407 IncrementalHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 191 mSDtfsCounter, 1407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 342 SyntacticMatches, 17 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=10, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 119 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 471 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671 SizeOfPredicates, 13 NumberOfNonLiveVariables, 848 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 269/448 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 6 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((i == 0) && (N <= 2147483647)) && (1 <= N)) || (((1 <= i) && (N <= 2147483647)) && (2 <= N))) || (((N <= 2147483647) && (i == 1)) && (1 <= N))) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((1 <= i) && (N <= 2147483647)) && (2 <= N)) || (((i == 0) && (N <= 2147483647)) && (2 <= N))) || ((N == 1) && (i == 1))) || ((i == 0) && (N == 1))) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((1 <= i) && (N <= 2147483647)) && (2 <= N)) || (((i == 0) && (N <= 2147483647)) && (2 <= N))) || ((N == 1) && (i == 1))) || ((i == 0) && (N == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:09:15,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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