./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:57:38,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:57:38,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 17:57:38,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:57:38,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:57:38,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:57:38,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:57:38,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:57:38,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:57:38,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:57:38,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:57:38,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:57:38,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:57:38,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:57:38,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:57:38,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:57:38,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 17:57:38,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:57:38,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:57:38,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:57:38,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:57:38,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 17:57:38,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:57:38,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 17:57:38,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:57:38,996 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 17:57:38,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:57:38,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:57:38,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 17:57:38,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:57:38,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:57:38,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:57:38,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:57:38,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:57:38,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:57:38,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:57:38,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:57:39,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 17:57:39,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:57:39,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:57:39,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:57:39,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:57:39,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:57:39,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:57:39,002 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 [2024-11-20 17:57:39,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:57:39,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:57:39,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:57:39,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:57:39,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:57:39,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c [2024-11-20 17:57:40,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:57:40,924 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:57:40,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c [2024-11-20 17:57:40,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e91ca7af/b1fbb46d29604c249492f8f3f5be8c52/FLAGd0468d02e [2024-11-20 17:57:41,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e91ca7af/b1fbb46d29604c249492f8f3f5be8c52 [2024-11-20 17:57:41,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:57:41,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:57:41,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:57:41,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:57:41,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:57:41,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ef77ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41, skipping insertion in model container [2024-11-20 17:57:41,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:57:41,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:57:41,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:57:41,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:57:41,585 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:57:41,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41 WrapperNode [2024-11-20 17:57:41,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:57:41,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:57:41,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:57:41,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:57:41,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,615 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2024-11-20 17:57:41,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:57:41,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:57:41,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:57:41,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:57:41,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,643 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 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-11-20 17:57:41,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:57:41,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:57:41,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:57:41,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:57:41,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (1/1) ... [2024-11-20 17:57:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:57:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:41,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:57:41,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:57:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:57:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:57:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:57:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:57:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:57:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:57:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:57:41,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:57:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:57:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:57:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:57:41,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:57:41,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:57:42,033 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-20 17:57:42,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:57:42,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:57:42,055 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-20 17:57:42,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:42 BoogieIcfgContainer [2024-11-20 17:57:42,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:57:42,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:57:42,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:57:42,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:57:42,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:57:41" (1/3) ... [2024-11-20 17:57:42,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13981ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:57:42, skipping insertion in model container [2024-11-20 17:57:42,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:57:41" (2/3) ... [2024-11-20 17:57:42,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13981ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:57:42, skipping insertion in model container [2024-11-20 17:57:42,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:42" (3/3) ... [2024-11-20 17:57:42,067 INFO L112 eAbstractionObserver]: Analyzing ICFG init-3-u.c [2024-11-20 17:57:42,084 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:57:42,085 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-20 17:57:42,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:57:42,166 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;@187a6e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:57:42,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-20 17:57:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 40 states have internal predecessors, (53), 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-11-20 17:57:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:57:42,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:42,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:57:42,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash 28699906, now seen corresponding path program 1 times [2024-11-20 17:57:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:42,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39238309] [2024-11-20 17:57:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39238309] [2024-11-20 17:57:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39238309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:57:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:57:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:57:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398585171] [2024-11-20 17:57:42,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:57:42,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:57:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:57:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:57:42,506 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-20 17:57:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:42,658 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2024-11-20 17:57:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:57:42,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 17:57:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:42,666 INFO L225 Difference]: With dead ends: 98 [2024-11-20 17:57:42,667 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 17:57:42,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:57:42,673 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:42,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 55 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:57:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 17:57:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-20 17:57:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-20 17:57:42,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 5 [2024-11-20 17:57:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:42,711 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-20 17:57:42,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-20 17:57:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-20 17:57:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 17:57:42,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:42,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 17:57:42,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:57:42,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 889698573, now seen corresponding path program 1 times [2024-11-20 17:57:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009647539] [2024-11-20 17:57:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009647539] [2024-11-20 17:57:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009647539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:57:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:57:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:57:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119550238] [2024-11-20 17:57:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:57:42,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:57:42,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:57:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:57:42,807 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:42,856 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-20 17:57:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:57:42,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 17:57:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:42,859 INFO L225 Difference]: With dead ends: 69 [2024-11-20 17:57:42,860 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 17:57:42,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:57:42,862 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:42,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:57:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 17:57:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-20 17:57:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.509433962264151) internal successors, (80), 64 states have internal predecessors, (80), 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-11-20 17:57:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-11-20 17:57:42,876 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 6 [2024-11-20 17:57:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:42,877 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-20 17:57:42,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-11-20 17:57:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:57:42,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:42,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:57:42,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:57:42,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:42,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash 765434955, now seen corresponding path program 1 times [2024-11-20 17:57:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969851744] [2024-11-20 17:57:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:42,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969851744] [2024-11-20 17:57:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969851744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:57:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:57:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:57:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151387032] [2024-11-20 17:57:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:57:42,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:57:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:57:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:57:42,974 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:43,041 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2024-11-20 17:57:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:57:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:57:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:43,045 INFO L225 Difference]: With dead ends: 128 [2024-11-20 17:57:43,045 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 17:57:43,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:57:43,046 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:57:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 17:57:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-20 17:57:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2024-11-20 17:57:43,058 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 9 [2024-11-20 17:57:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:43,059 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2024-11-20 17:57:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2024-11-20 17:57:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:57:43,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:43,060 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:57:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:57:43,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 767067060, now seen corresponding path program 1 times [2024-11-20 17:57:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499763231] [2024-11-20 17:57:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499763231] [2024-11-20 17:57:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499763231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161701724] [2024-11-20 17:57:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:43,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:43,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:43,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 17:57:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:43,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:57:43,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:43,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:57:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161701724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:57:43,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:57:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 17:57:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123814062] [2024-11-20 17:57:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:57:43,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:57:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:43,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:57:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:57:43,275 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:43,318 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-20 17:57:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:57:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:57:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:43,320 INFO L225 Difference]: With dead ends: 65 [2024-11-20 17:57:43,320 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 17:57:43,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:57:43,323 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:43,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:57:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 17:57:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-20 17:57:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 62 states have internal predecessors, (72), 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-11-20 17:57:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-11-20 17:57:43,334 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 9 [2024-11-20 17:57:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:43,334 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-11-20 17:57:43,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-11-20 17:57:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 17:57:43,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:43,335 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 17:57:43,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 17:57:43,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:43,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1990724853, now seen corresponding path program 1 times [2024-11-20 17:57:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568686980] [2024-11-20 17:57:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:43,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568686980] [2024-11-20 17:57:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568686980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224259828] [2024-11-20 17:57:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:43,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:43,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:43,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:43,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 17:57:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:43,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:57:43,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:43,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:57:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224259828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:43,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-20 17:57:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634735835] [2024-11-20 17:57:43,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:57:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:57:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:57:43,731 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:43,818 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2024-11-20 17:57:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:57:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-20 17:57:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:43,821 INFO L225 Difference]: With dead ends: 113 [2024-11-20 17:57:43,822 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 17:57:43,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:57:43,824 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:43,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:57:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 17:57:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-20 17:57:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 101 states have (on average 1.306930693069307) internal successors, (132), 110 states have internal predecessors, (132), 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-11-20 17:57:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2024-11-20 17:57:43,844 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 10 [2024-11-20 17:57:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:43,844 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2024-11-20 17:57:43,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2024-11-20 17:57:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 17:57:43,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:43,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:57:43,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 17:57:44,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:44,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:44,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1827767228, now seen corresponding path program 1 times [2024-11-20 17:57:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078897383] [2024-11-20 17:57:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:57:44,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:44,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078897383] [2024-11-20 17:57:44,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078897383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:57:44,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:57:44,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:57:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075507724] [2024-11-20 17:57:44,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:57:44,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:57:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:57:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:57:44,098 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-20 17:57:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:44,142 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2024-11-20 17:57:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:57:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-20 17:57:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:44,145 INFO L225 Difference]: With dead ends: 219 [2024-11-20 17:57:44,145 INFO L226 Difference]: Without dead ends: 215 [2024-11-20 17:57:44,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:57:44,146 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:44,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:57:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-20 17:57:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2024-11-20 17:57:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 208 states have internal predecessors, (257), 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-11-20 17:57:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2024-11-20 17:57:44,168 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 12 [2024-11-20 17:57:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2024-11-20 17:57:44,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-20 17:57:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2024-11-20 17:57:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 17:57:44,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:44,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 17:57:44,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:57:44,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:44,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash 903061951, now seen corresponding path program 1 times [2024-11-20 17:57:44,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:44,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943109515] [2024-11-20 17:57:44,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:44,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:57:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943109515] [2024-11-20 17:57:44,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943109515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:44,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169437395] [2024-11-20 17:57:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:44,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:44,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 17:57:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:44,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:57:44,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:57:44,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:57:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169437395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:44,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2024-11-20 17:57:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285223083] [2024-11-20 17:57:44,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:57:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:57:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:57:44,409 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-11-20 17:57:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:44,755 INFO L93 Difference]: Finished difference Result 399 states and 489 transitions. [2024-11-20 17:57:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 17:57:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-20 17:57:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:44,757 INFO L225 Difference]: With dead ends: 399 [2024-11-20 17:57:44,757 INFO L226 Difference]: Without dead ends: 209 [2024-11-20 17:57:44,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-20 17:57:44,758 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 228 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:44,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 65 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:57:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-20 17:57:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-20 17:57:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.150753768844221) internal successors, (229), 206 states have internal predecessors, (229), 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-11-20 17:57:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2024-11-20 17:57:44,774 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 16 [2024-11-20 17:57:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2024-11-20 17:57:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-11-20 17:57:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2024-11-20 17:57:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 17:57:44,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:44,776 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2024-11-20 17:57:44,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:57:44,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:44,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:44,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1756482670, now seen corresponding path program 2 times [2024-11-20 17:57:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919378194] [2024-11-20 17:57:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-20 17:57:45,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919378194] [2024-11-20 17:57:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919378194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672547800] [2024-11-20 17:57:45,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:57:45,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:45,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:45,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:45,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 17:57:45,102 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:57:45,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:57:45,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:57:45,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-20 17:57:45,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-20 17:57:45,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672547800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:45,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:45,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-20 17:57:45,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166020859] [2024-11-20 17:57:45,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:45,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:57:45,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:45,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:57:45,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:57:45,186 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:45,236 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2024-11-20 17:57:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:57:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 17:57:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:45,237 INFO L225 Difference]: With dead ends: 207 [2024-11-20 17:57:45,237 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 17:57:45,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:57:45,238 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:45,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:57:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 17:57:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 181. [2024-11-20 17:57:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 175 states have (on average 1.1257142857142857) internal successors, (197), 180 states have internal predecessors, (197), 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-11-20 17:57:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2024-11-20 17:57:45,262 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 19 [2024-11-20 17:57:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:45,262 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2024-11-20 17:57:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:57:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2024-11-20 17:57:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 17:57:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:45,265 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-20 17:57:45,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 17:57:45,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:45,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:45,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 211563321, now seen corresponding path program 1 times [2024-11-20 17:57:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:45,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200726755] [2024-11-20 17:57:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:45,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-20 17:57:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200726755] [2024-11-20 17:57:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200726755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478647550] [2024-11-20 17:57:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:45,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:45,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 17:57:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:45,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 17:57:45,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 17:57:45,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 17:57:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478647550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:45,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:45,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2024-11-20 17:57:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375878] [2024-11-20 17:57:45,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:45,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 17:57:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 17:57:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-20 17:57:45,853 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 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-11-20 17:57:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:46,484 INFO L93 Difference]: Finished difference Result 713 states and 827 transitions. [2024-11-20 17:57:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-20 17:57:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-20 17:57:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:46,487 INFO L225 Difference]: With dead ends: 713 [2024-11-20 17:57:46,487 INFO L226 Difference]: Without dead ends: 549 [2024-11-20 17:57:46,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2024-11-20 17:57:46,489 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 762 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:46,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 84 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:57:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-20 17:57:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2024-11-20 17:57:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 543 states have (on average 1.0478821362799264) internal successors, (569), 548 states have internal predecessors, (569), 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-11-20 17:57:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 569 transitions. [2024-11-20 17:57:46,533 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 569 transitions. Word has length 35 [2024-11-20 17:57:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 569 transitions. [2024-11-20 17:57:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 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-11-20 17:57:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 569 transitions. [2024-11-20 17:57:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 17:57:46,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:46,537 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 2, 1, 1, 1, 1] [2024-11-20 17:57:46,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 17:57:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:46,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1547156258, now seen corresponding path program 2 times [2024-11-20 17:57:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:46,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790027143] [2024-11-20 17:57:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-20 17:57:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790027143] [2024-11-20 17:57:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790027143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686225360] [2024-11-20 17:57:46,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:57:46,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:46,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:46,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 17:57:46,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:57:46,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:57:46,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:57:46,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-20 17:57:47,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-20 17:57:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686225360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:47,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-20 17:57:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874975136] [2024-11-20 17:57:47,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:47,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:57:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:57:47,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:57:47,270 INFO L87 Difference]: Start difference. First operand 549 states and 569 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-11-20 17:57:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:47,323 INFO L93 Difference]: Finished difference Result 549 states and 569 transitions. [2024-11-20 17:57:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:57:47,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-20 17:57:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:47,328 INFO L225 Difference]: With dead ends: 549 [2024-11-20 17:57:47,328 INFO L226 Difference]: Without dead ends: 547 [2024-11-20 17:57:47,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:57:47,330 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:47,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:57:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-20 17:57:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 375. [2024-11-20 17:57:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.0485175202156334) internal successors, (389), 374 states have internal predecessors, (389), 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-11-20 17:57:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 389 transitions. [2024-11-20 17:57:47,351 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 389 transitions. Word has length 105 [2024-11-20 17:57:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:47,352 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 389 transitions. [2024-11-20 17:57:47,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-11-20 17:57:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 389 transitions. [2024-11-20 17:57:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 17:57:47,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:47,355 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-11-20 17:57:47,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 17:57:47,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:47,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:47,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1091822397, now seen corresponding path program 1 times [2024-11-20 17:57:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:47,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494599004] [2024-11-20 17:57:47,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 0 proven. 1303 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2024-11-20 17:57:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494599004] [2024-11-20 17:57:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494599004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770634467] [2024-11-20 17:57:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:47,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:47,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:47,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 17:57:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:47,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 17:57:47,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 969 proven. 145 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2024-11-20 17:57:48,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 969 proven. 145 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2024-11-20 17:57:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770634467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:48,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 14, 14] total 28 [2024-11-20 17:57:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948574598] [2024-11-20 17:57:48,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-20 17:57:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-20 17:57:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2024-11-20 17:57:48,448 INFO L87 Difference]: Start difference. First operand 375 states and 389 transitions. Second operand has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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-11-20 17:57:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:49,751 INFO L93 Difference]: Finished difference Result 1097 states and 1221 transitions. [2024-11-20 17:57:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-20 17:57:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-20 17:57:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:49,755 INFO L225 Difference]: With dead ends: 1097 [2024-11-20 17:57:49,755 INFO L226 Difference]: Without dead ends: 757 [2024-11-20 17:57:49,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2024-11-20 17:57:49,758 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1017 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:49,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 163 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 17:57:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-20 17:57:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2024-11-20 17:57:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 755 states have (on average 1.0198675496688743) internal successors, (770), 756 states have internal predecessors, (770), 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-11-20 17:57:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 770 transitions. [2024-11-20 17:57:49,791 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 770 transitions. Word has length 145 [2024-11-20 17:57:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:49,792 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 770 transitions. [2024-11-20 17:57:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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-11-20 17:57:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 770 transitions. [2024-11-20 17:57:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-20 17:57:49,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:49,795 INFO L215 NwaCegarLoop]: trace histogram [88, 88, 88, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1] [2024-11-20 17:57:49,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 17:57:49,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:49,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:49,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 57591216, now seen corresponding path program 1 times [2024-11-20 17:57:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321546822] [2024-11-20 17:57:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11872 backedges. 0 proven. 6008 refuted. 0 times theorem prover too weak. 5864 trivial. 0 not checked. [2024-11-20 17:57:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321546822] [2024-11-20 17:57:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321546822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187734190] [2024-11-20 17:57:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:50,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:50,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:50,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:50,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 17:57:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:50,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 17:57:50,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11872 backedges. 4497 proven. 715 refuted. 0 times theorem prover too weak. 6660 trivial. 0 not checked. [2024-11-20 17:57:51,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:57:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11872 backedges. 4497 proven. 715 refuted. 0 times theorem prover too weak. 6660 trivial. 0 not checked. [2024-11-20 17:57:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187734190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:57:51,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:57:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 26, 26] total 52 [2024-11-20 17:57:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295433232] [2024-11-20 17:57:51,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:57:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-20 17:57:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:57:51,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-20 17:57:51,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2024-11-20 17:57:51,821 INFO L87 Difference]: Start difference. First operand 757 states and 770 transitions. Second operand has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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-11-20 17:57:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:57:56,595 INFO L93 Difference]: Finished difference Result 2971 states and 3293 transitions. [2024-11-20 17:57:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-20 17:57:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2024-11-20 17:57:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:57:56,603 INFO L225 Difference]: With dead ends: 2971 [2024-11-20 17:57:56,603 INFO L226 Difference]: Without dead ends: 2285 [2024-11-20 17:57:56,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2024-11-20 17:57:56,610 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2943 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2943 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:57:56,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2943 Valid, 149 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 17:57:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2024-11-20 17:57:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2285. [2024-11-20 17:57:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2283 states have (on average 1.0091984231274638) internal successors, (2304), 2284 states have internal predecessors, (2304), 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-11-20 17:57:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2304 transitions. [2024-11-20 17:57:56,695 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2304 transitions. Word has length 290 [2024-11-20 17:57:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:57:56,697 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 2304 transitions. [2024-11-20 17:57:56,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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-11-20 17:57:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2304 transitions. [2024-11-20 17:57:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2024-11-20 17:57:56,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:57:56,716 INFO L215 NwaCegarLoop]: trace histogram [276, 276, 276, 6, 6, 6, 6, 3, 3, 3, 2, 1, 1, 1] [2024-11-20 17:57:56,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 17:57:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 17:57:56,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-20 17:57:56,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:57:56,918 INFO L85 PathProgramCache]: Analyzing trace with hash -748884057, now seen corresponding path program 2 times [2024-11-20 17:57:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:57:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97196906] [2024-11-20 17:57:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:57:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:57:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:57:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 115596 backedges. 0 proven. 51566 refuted. 0 times theorem prover too weak. 64030 trivial. 0 not checked. [2024-11-20 17:57:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:57:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97196906] [2024-11-20 17:57:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97196906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:57:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166389378] [2024-11-20 17:57:58,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:57:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:57:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:57:58,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:57:58,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 17:57:58,341 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:57:58,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:57:58,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:57:58,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:57:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 115596 backedges. 0 proven. 51566 refuted. 0 times theorem prover too weak. 64030 trivial. 0 not checked. [2024-11-20 17:57:59,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:58:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 115596 backedges. 0 proven. 51566 refuted. 0 times theorem prover too weak. 64030 trivial. 0 not checked. [2024-11-20 17:58:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166389378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:58:00,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:58:00,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-20 17:58:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60739649] [2024-11-20 17:58:00,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:58:00,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:58:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:58:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:58:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:58:00,046 INFO L87 Difference]: Start difference. First operand 2285 states and 2304 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-11-20 17:58:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:58:00,148 INFO L93 Difference]: Finished difference Result 2285 states and 2304 transitions. [2024-11-20 17:58:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:58:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 866 [2024-11-20 17:58:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:58:00,151 INFO L225 Difference]: With dead ends: 2285 [2024-11-20 17:58:00,151 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 17:58:00,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1735 GetRequests, 1729 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:58:00,154 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:58:00,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 16 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:58:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 17:58:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 17:58:00,155 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-11-20 17:58:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 17:58:00,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 866 [2024-11-20 17:58:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:58:00,156 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 17:58:00,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-11-20 17:58:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 17:58:00,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 17:58:00,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-20 17:58:00,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-20 17:58:00,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-20 17:58:00,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-20 17:58:00,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-20 17:58:00,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-20 17:58:00,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-20 17:58:00,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-20 17:58:00,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-20 17:58:00,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-20 17:58:00,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-20 17:58:00,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-20 17:58:00,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 17:58:00,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 17:58:00,366 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:58:00,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 17:58:07,280 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 465 DAG size of output: 406 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-20 17:58:13,201 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 465 DAG size of output: 406 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-20 17:58:18,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:58:18,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:58:18 BoogieIcfgContainer [2024-11-20 17:58:18,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:58:18,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:58:18,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:58:18,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:58:18,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:57:42" (3/4) ... [2024-11-20 17:58:18,250 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 17:58:18,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-20 17:58:18,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 17:58:18,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 17:58:18,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 17:58:18,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 17:58:18,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 17:58:18,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:58:18,353 INFO L158 Benchmark]: Toolchain (without parser) took 37018.39ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 119.2MB in the beginning and 964.8MB in the end (delta: -845.7MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,354 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 176.2MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:58:18,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.21ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 106.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.35ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 105.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,355 INFO L158 Benchmark]: Boogie Preprocessor took 44.27ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,355 INFO L158 Benchmark]: RCFGBuilder took 395.23ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 89.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,355 INFO L158 Benchmark]: TraceAbstraction took 36187.94ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 88.9MB in the beginning and 970.1MB in the end (delta: -881.2MB). Peak memory consumption was 599.5MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,356 INFO L158 Benchmark]: Witness Printer took 105.89ms. Allocated memory is still 1.0GB. Free memory was 970.1MB in the beginning and 964.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 17:58:18,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 176.2MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.21ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 106.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.35ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 105.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.27ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.23ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 89.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36187.94ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 88.9MB in the beginning and 970.1MB in the end (delta: -881.2MB). Peak memory consumption was 599.5MB. Max. memory is 16.1GB. * Witness Printer took 105.89ms. Allocated memory is still 1.0GB. Free memory was 970.1MB in the beginning and 964.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 13, TraceHistogramMax: 276, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5243 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5243 mSDsluCounter, 914 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 634 mSDsCounter, 896 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1373 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 896 mSolverCounterUnsat, 280 mSDtfsCounter, 1373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3209 GetRequests, 2879 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2285occurred in iteration=12, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 208 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 3022 NumberOfCodeBlocks, 2052 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4478 ConstructedInterpolants, 0 QuantifiedInterpolants, 12606 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1846 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 228862/394678 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 12 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000)) || ((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k == 0)) && (j <= 999)) && (n == 1000))) || (((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || ((((((i == 0) && (1 <= j)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || (((((i == 0) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000))) || (((((1 <= i) && (i <= 999)) && (k == 0)) && (j == 0)) && (n == 1000))) || (((((i == 0) && (1 <= j)) && (k == 0)) && (j <= 999)) && (n == 1000))) || ((((i == 0) && (k == 0)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000)) || ((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k == 0)) && (j <= 999)) && (n == 1000))) || (((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || ((((((i == 0) && (1 <= j)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || (((((i == 0) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000))) || (((((1 <= i) && (i <= 999)) && (k == 0)) && (j == 0)) && (n == 1000))) || (((((i == 0) && (1 <= j)) && (k == 0)) && (j <= 999)) && (n == 1000))) || ((((i == 0) && (k == 0)) && (j == 0)) && (n == 1000))) RESULT: Ultimate proved your program to be correct! [2024-11-20 17:58:18,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE