./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.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/verifythis/elimination_max_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:20:46,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:20:46,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:20:46,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:20:46,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:20:46,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:20:46,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:20:46,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:20:46,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:20:46,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:20:46,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:20:46,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:20:46,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:20:46,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:20:46,324 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:20:46,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:20:46,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:20:46,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:20:46,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:20:46,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:20:46,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:20:46,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:20:46,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:20:46,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:20:46,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:20:46,329 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:20:46,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:20:46,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:20:46,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:20:46,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:20:46,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:20:46,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:20:46,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:20:46,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:20:46,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:46,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:20:46,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:20:46,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:20:46,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:20:46,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:20:46,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:20:46,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:20:46,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:20:46,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:20:46,332 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2024-10-11 21:20:46,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:20:46,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:20:46,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:20:46,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:20:46,563 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:20:46,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-11 21:20:47,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:20:47,883 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:20:47,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-10-11 21:20:47,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef83b7c89/c311d48df6124dc48bb1ddf539539653/FLAG68629ef73 [2024-10-11 21:20:47,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef83b7c89/c311d48df6124dc48bb1ddf539539653 [2024-10-11 21:20:47,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:20:47,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:20:47,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:47,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:20:47,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:20:47,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:47" (1/1) ... [2024-10-11 21:20:47,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fb110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:47, skipping insertion in model container [2024-10-11 21:20:47,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:47" (1/1) ... [2024-10-11 21:20:47,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:20:48,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:48,078 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:20:48,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:48,104 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:20:48,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48 WrapperNode [2024-10-11 21:20:48,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:48,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:48,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:20:48,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:20:48,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,134 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 33 [2024-10-11 21:20:48,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:48,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:20:48,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:20:48,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:20:48,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,154 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 21:20:48,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:20:48,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:20:48,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:20:48,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:20:48,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (1/1) ... [2024-10-11 21:20:48,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:48,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:48,192 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 21:20:48,193 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 21:20:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:20:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 21:20:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 21:20:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:20:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:20:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-11 21:20:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-11 21:20:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 21:20:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:20:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:20:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 21:20:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 21:20:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:20:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:20:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:20:48,281 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:20:48,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:20:48,415 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 21:20:48,416 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:20:48,442 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:20:48,442 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:20:48,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:48 BoogieIcfgContainer [2024-10-11 21:20:48,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:20:48,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:20:48,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:20:48,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:20:48,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:20:47" (1/3) ... [2024-10-11 21:20:48,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48de8777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:48, skipping insertion in model container [2024-10-11 21:20:48,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:48" (2/3) ... [2024-10-11 21:20:48,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48de8777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:48, skipping insertion in model container [2024-10-11 21:20:48,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:48" (3/3) ... [2024-10-11 21:20:48,450 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-10-11 21:20:48,463 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:20:48,463 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 21:20:48,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:20:48,508 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;@118d5369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:20:48,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 21:20:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:20:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:20:48,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:48,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:48,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:48,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2021493796, now seen corresponding path program 1 times [2024-10-11 21:20:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:48,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670427217] [2024-10-11 21:20:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,664 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 21:20:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670427217] [2024-10-11 21:20:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670427217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:48,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:20:48,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385263117] [2024-10-11 21:20:48,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:48,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:20:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:48,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:20:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:20:48,692 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:20:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:48,715 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2024-10-11 21:20:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:20:48,719 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-11 21:20:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:48,724 INFO L225 Difference]: With dead ends: 76 [2024-10-11 21:20:48,725 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 21:20:48,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 21:20:48,730 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:48,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 21:20:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 21:20:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-11 21:20:48,756 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 8 [2024-10-11 21:20:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:48,756 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-11 21:20:48,757 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:20:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-11 21:20:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:20:48,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:48,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:48,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:20:48,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:48,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2019646754, now seen corresponding path program 1 times [2024-10-11 21:20:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:48,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283863463] [2024-10-11 21:20:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:48,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,940 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 21:20:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:48,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283863463] [2024-10-11 21:20:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283863463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062348015] [2024-10-11 21:20:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:48,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:48,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:48,946 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:20:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:48,972 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-11 21:20:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-11 21:20:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:48,973 INFO L225 Difference]: With dead ends: 30 [2024-10-11 21:20:48,973 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 21:20:48,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:48,974 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:48,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 21:20:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 21:20:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-11 21:20:48,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 8 [2024-10-11 21:20:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:48,979 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-11 21:20:48,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:20:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-11 21:20:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 21:20:48,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:48,980 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 21:20:48,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:20:48,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:48,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1280588809, now seen corresponding path program 1 times [2024-10-11 21:20:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372342212] [2024-10-11 21:20:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,111 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 21:20:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:49,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372342212] [2024-10-11 21:20:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372342212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:49,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:49,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110131980] [2024-10-11 21:20:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:49,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:49,120 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:49,189 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-11 21:20:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:49,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 21:20:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:49,190 INFO L225 Difference]: With dead ends: 43 [2024-10-11 21:20:49,190 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 21:20:49,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:49,191 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:49,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 84 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 21:20:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-10-11 21:20:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-11 21:20:49,200 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 20 [2024-10-11 21:20:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:49,202 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-11 21:20:49,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-11 21:20:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 21:20:49,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:49,204 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 21:20:49,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:20:49,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:49,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1280589001, now seen corresponding path program 1 times [2024-10-11 21:20:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:49,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011535378] [2024-10-11 21:20:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,336 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 21:20:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011535378] [2024-10-11 21:20:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011535378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826756246] [2024-10-11 21:20:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:49,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:49,345 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:49,472 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-11 21:20:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:20:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 21:20:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:49,474 INFO L225 Difference]: With dead ends: 41 [2024-10-11 21:20:49,474 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 21:20:49,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:49,476 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:49,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 21:20:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-11 21:20:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 30 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-11 21:20:49,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 20 [2024-10-11 21:20:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:49,487 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-11 21:20:49,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-11 21:20:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 21:20:49,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:49,489 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, 1] [2024-10-11 21:20:49,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:20:49,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:49,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1043553440, now seen corresponding path program 1 times [2024-10-11 21:20:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:49,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867744461] [2024-10-11 21:20:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,589 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 21:20:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867744461] [2024-10-11 21:20:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867744461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380257150] [2024-10-11 21:20:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:49,592 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:49,640 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-11 21:20:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:49,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 21:20:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:49,642 INFO L225 Difference]: With dead ends: 38 [2024-10-11 21:20:49,642 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 21:20:49,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 21:20:49,643 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:49,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 21:20:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 21:20:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-10-11 21:20:49,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2024-10-11 21:20:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:49,655 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-10-11 21:20:49,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:20:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-10-11 21:20:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 21:20:49,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:49,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:49,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:20:49,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 733849789, now seen corresponding path program 1 times [2024-10-11 21:20:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376045749] [2024-10-11 21:20:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:20:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376045749] [2024-10-11 21:20:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376045749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555758975] [2024-10-11 21:20:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:49,783 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 21:20:49,784 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 21:20:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:49,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:20:49,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:49,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:49,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555758975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:49,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:49,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-10-11 21:20:49,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363966853] [2024-10-11 21:20:49,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:49,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:49,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:49,935 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:50,024 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-11 21:20:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:50,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-10-11 21:20:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:50,025 INFO L225 Difference]: With dead ends: 38 [2024-10-11 21:20:50,025 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 21:20:50,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:20:50,026 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:50,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 21:20:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-11 21:20:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-11 21:20:50,030 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 32 [2024-10-11 21:20:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:50,031 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-11 21:20:50,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-10-11 21:20:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 21:20:50,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:50,032 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:50,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:50,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:50,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:50,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash 733849981, now seen corresponding path program 1 times [2024-10-11 21:20:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280128340] [2024-10-11 21:20:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:50,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:20:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280128340] [2024-10-11 21:20:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280128340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885452912] [2024-10-11 21:20:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:50,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:50,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:50,313 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 21:20:50,314 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 21:20:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:20:50,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:50,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:20:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885452912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:20:50,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:20:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-10-11 21:20:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101031074] [2024-10-11 21:20:50,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:20:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 21:20:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 21:20:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-10-11 21:20:50,555 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:20:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:50,796 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-11 21:20:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:20:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 32 [2024-10-11 21:20:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:50,799 INFO L225 Difference]: With dead ends: 38 [2024-10-11 21:20:50,799 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 21:20:50,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 21:20:50,801 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 71 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:50,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 165 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 21:20:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-10-11 21:20:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:20:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-11 21:20:50,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2024-10-11 21:20:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:50,806 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-11 21:20:50,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:20:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-11 21:20:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 21:20:50,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:50,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:50,820 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 21:20:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:51,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:51,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1274507046, now seen corresponding path program 1 times [2024-10-11 21:20:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879245828] [2024-10-11 21:20:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:20:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:51,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:51,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879245828] [2024-10-11 21:20:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879245828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759499541] [2024-10-11 21:20:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:51,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:51,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:51,097 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 21:20:51,098 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 21:20:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:20:51,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:51,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:20:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759499541] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:20:51,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:20:51,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-11 21:20:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624338397] [2024-10-11 21:20:51,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:20:51,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 21:20:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 21:20:51,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:20:51,259 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:20:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:51,408 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-10-11 21:20:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2024-10-11 21:20:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:51,410 INFO L225 Difference]: With dead ends: 70 [2024-10-11 21:20:51,410 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 21:20:51,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-10-11 21:20:51,411 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:51,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 107 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 21:20:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-11 21:20:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:20:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-10-11 21:20:51,418 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 33 [2024-10-11 21:20:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:51,418 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-10-11 21:20:51,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:20:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-10-11 21:20:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 21:20:51,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:51,420 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:51,432 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 21:20:51,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:51,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:51,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -81395574, now seen corresponding path program 2 times [2024-10-11 21:20:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053532187] [2024-10-11 21:20:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:20:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 21:20:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:20:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053532187] [2024-10-11 21:20:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053532187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504375070] [2024-10-11 21:20:51,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:20:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:51,890 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 21:20:51,891 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 21:20:51,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:20:51,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:20:51,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 21:20:51,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:20:52,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:20:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:20:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504375070] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:20:52,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:20:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2024-10-11 21:20:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554738449] [2024-10-11 21:20:52,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:20:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 21:20:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 21:20:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 21:20:52,286 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 24 states have internal predecessors, (76), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 21:20:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:52,755 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2024-10-11 21:20:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 21:20:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 24 states have internal predecessors, (76), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2024-10-11 21:20:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:52,757 INFO L225 Difference]: With dead ends: 136 [2024-10-11 21:20:52,757 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 21:20:52,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=3202, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 21:20:52,759 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 270 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:52,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 206 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 21:20:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-10-11 21:20:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 99 states have internal predecessors, (110), 24 states have call successors, (24), 13 states have call predecessors, (24), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 21:20:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2024-10-11 21:20:52,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 69 [2024-10-11 21:20:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2024-10-11 21:20:52,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 24 states have internal predecessors, (76), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 21:20:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2024-10-11 21:20:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 21:20:52,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:52,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:52,797 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 21:20:52,983 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,SelfDestructingSolverStorable8 [2024-10-11 21:20:52,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1755677358, now seen corresponding path program 3 times [2024-10-11 21:20:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:52,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248421163] [2024-10-11 21:20:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 21:20:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:20:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 21:20:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:20:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 21:20:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 21:20:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 21:20:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 21:20:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 21:20:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:20:53,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:53,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248421163] [2024-10-11 21:20:53,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248421163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135641974] [2024-10-11 21:20:53,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:20:53,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:53,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:53,864 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 21:20:53,866 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 21:20:53,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 21:20:53,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:20:53,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 21:20:53,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-11 21:20:54,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:20:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-11 21:20:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135641974] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:20:54,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:20:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2024-10-11 21:20:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084326824] [2024-10-11 21:20:54,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:20:54,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 21:20:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 21:20:54,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 21:20:54,405 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 32 states have internal predecessors, (106), 18 states have call successors, (33), 14 states have call predecessors, (33), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 21:20:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:57,245 INFO L93 Difference]: Finished difference Result 279 states and 329 transitions. [2024-10-11 21:20:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-10-11 21:20:57,245 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 32 states have internal predecessors, (106), 18 states have call successors, (33), 14 states have call predecessors, (33), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 141 [2024-10-11 21:20:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:57,246 INFO L225 Difference]: With dead ends: 279 [2024-10-11 21:20:57,246 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:20:57,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9950 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5785, Invalid=25015, Unknown=0, NotChecked=0, Total=30800 [2024-10-11 21:20:57,253 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 729 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:57,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 245 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:20:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:20:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:20:57,254 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 21:20:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:20:57,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2024-10-11 21:20:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:57,254 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:20:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 32 states have internal predecessors, (106), 18 states have call successors, (33), 14 states have call predecessors, (33), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 21:20:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:20:57,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:20:57,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 21:20:57,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 21:20:57,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 21:20:57,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 21:20:57,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 21:20:57,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 21:20:57,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:57,458 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 21:20:57,461 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:57,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:20:59,760 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:20:59,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:20:59 BoogieIcfgContainer [2024-10-11 21:20:59,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:20:59,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:20:59,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:20:59,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:20:59,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:48" (3/4) ... [2024-10-11 21:20:59,775 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:20:59,778 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 21:20:59,778 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2024-10-11 21:20:59,778 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 21:20:59,781 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-11 21:20:59,781 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 21:20:59,781 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 21:20:59,781 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:20:59,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:20:59,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:20:59,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:20:59,851 INFO L158 Benchmark]: Toolchain (without parser) took 11951.29ms. Allocated memory was 169.9MB in the beginning and 371.2MB in the end (delta: 201.3MB). Free memory was 136.7MB in the beginning and 262.0MB in the end (delta: -125.3MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-10-11 21:20:59,851 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 169.9MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:20:59,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.74ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 131.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 21:20:59,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.48ms. Allocated memory is still 169.9MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:59,852 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 169.9MB. Free memory was 129.4MB in the beginning and 128.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:20:59,852 INFO L158 Benchmark]: RCFGBuilder took 278.19ms. Allocated memory is still 169.9MB. Free memory was 127.3MB in the beginning and 132.1MB in the end (delta: -4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:20:59,852 INFO L158 Benchmark]: TraceAbstraction took 11328.59ms. Allocated memory was 169.9MB in the beginning and 371.2MB in the end (delta: 201.3MB). Free memory was 132.1MB in the beginning and 267.2MB in the end (delta: -135.2MB). Peak memory consumption was 213.8MB. Max. memory is 16.1GB. [2024-10-11 21:20:59,852 INFO L158 Benchmark]: Witness Printer took 77.47ms. Allocated memory is still 371.2MB. Free memory was 267.2MB in the beginning and 262.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:20:59,853 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.81ms. Allocated memory is still 169.9MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.74ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 131.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.48ms. Allocated memory is still 169.9MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 169.9MB. Free memory was 129.4MB in the beginning and 128.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 278.19ms. Allocated memory is still 169.9MB. Free memory was 127.3MB in the beginning and 132.1MB in the end (delta: -4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11328.59ms. Allocated memory was 169.9MB in the beginning and 371.2MB in the end (delta: 201.3MB). Free memory was 132.1MB in the beginning and 267.2MB in the end (delta: -135.2MB). Peak memory consumption was 213.8MB. Max. memory is 16.1GB. * Witness Printer took 77.47ms. Allocated memory is still 371.2MB. Free memory was 267.2MB in the beginning and 262.0MB in the end (delta: 5.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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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 4 procedures, 39 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1238 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1238 mSDsluCounter, 1208 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 991 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1052 IncrementalHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 217 mSDtfsCounter, 1052 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=9, InterpolantAutomatonStates: 243, 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, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 2069 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1262 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1582/2378 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 - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 16]: Procedure Contract for check Derived contract for procedure check. Requires: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) Ensures: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:20:59,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE