./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a888b919d012babd5ba30e3ca20e72df0dea0bc5e498f464f6a948a8ccca3b4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:11:07,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:11:07,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:11:07,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:11:07,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:11:07,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:11:07,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:11:07,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:11:07,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:11:07,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:11:07,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:11:07,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:11:07,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:11:07,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:11:07,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:11:07,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:11:07,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:11:07,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:11:07,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:11:07,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:11:07,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:11:07,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:11:07,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:11:07,283 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:11:07,284 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:11:07,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:11:07,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:11:07,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:11:07,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:11:07,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:11:07,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:11:07,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:07,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:11:07,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:11:07,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:11:07,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:11:07,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:11:07,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:11:07,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:11:07,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:11:07,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:11:07,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a888b919d012babd5ba30e3ca20e72df0dea0bc5e498f464f6a948a8ccca3b4b [2024-10-11 22:11:07,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:11:07,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:11:07,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:11:07,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:11:07,607 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:11:07,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2024-10-11 22:11:09,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:11:09,421 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:11:09,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2024-10-11 22:11:09,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/110e4d2ec/fdd40309eb9f42b6a93bd9618dbe896c/FLAGdea74a12c [2024-10-11 22:11:09,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/110e4d2ec/fdd40309eb9f42b6a93bd9618dbe896c [2024-10-11 22:11:09,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:11:09,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:11:09,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:09,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:11:09,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:11:09,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:09" (1/1) ... [2024-10-11 22:11:09,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ece538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:09, skipping insertion in model container [2024-10-11 22:11:09,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:09" (1/1) ... [2024-10-11 22:11:09,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:11:10,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:10,530 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:11:10,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:10,771 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:11:10,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10 WrapperNode [2024-10-11 22:11:10,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:10,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:10,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:11:10,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:11:10,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,833 INFO L138 Inliner]: procedures = 499, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2024-10-11 22:11:10,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:10,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:11:10,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:11:10,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:11:10,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,870 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:11:10,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:11:10,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:11:10,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:11:10,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:11:10,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (1/1) ... [2024-10-11 22:11:10,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:10,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:11:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:11:10,986 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:11:10,986 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:11:10,986 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-11 22:11:10,987 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-11 22:11:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:11:10,987 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:11:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:11:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:11:10,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:11:11,146 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:11:11,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:11:11,324 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 22:11:11,324 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:11:11,359 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:11:11,360 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:11:11,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:11 BoogieIcfgContainer [2024-10-11 22:11:11,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:11:11,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:11:11,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:11:11,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:11:11,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:11:09" (1/3) ... [2024-10-11 22:11:11,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298fb268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:11, skipping insertion in model container [2024-10-11 22:11:11,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:10" (2/3) ... [2024-10-11 22:11:11,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298fb268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:11, skipping insertion in model container [2024-10-11 22:11:11,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:11" (3/3) ... [2024-10-11 22:11:11,373 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2024-10-11 22:11:11,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:11:11,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:11:11,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:11:11,503 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;@2b8f2203, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:11:11,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:11:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 42 states have internal predecessors, (49), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 22:11:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 22:11:11,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:11,516 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:11,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash -436570351, now seen corresponding path program 1 times [2024-10-11 22:11:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863987906] [2024-10-11 22:11:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 22:11:12,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863987906] [2024-10-11 22:11:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863987906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158005633] [2024-10-11 22:11:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,064 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 42 states have internal predecessors, (49), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:11:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,145 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-10-11 22:11:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 22:11:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,156 INFO L225 Difference]: With dead ends: 58 [2024-10-11 22:11:12,156 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 22:11:12,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,164 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:11:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 22:11:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 22:11:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.4) internal successors, (42), 36 states have internal predecessors, (42), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 22:11:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-10-11 22:11:12,204 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 19 [2024-10-11 22:11:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,205 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-10-11 22:11:12,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:11:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-10-11 22:11:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 22:11:12,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,207 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:11:12,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:12,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash -436554463, now seen corresponding path program 1 times [2024-10-11 22:11:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648898594] [2024-10-11 22:11:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 22:11:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648898594] [2024-10-11 22:11:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648898594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984192137] [2024-10-11 22:11:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,324 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:11:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,365 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-11 22:11:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 22:11:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,367 INFO L225 Difference]: With dead ends: 49 [2024-10-11 22:11:12,367 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 22:11:12,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,369 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 22:11:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 22:11:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 22:11:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-11 22:11:12,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 19 [2024-10-11 22:11:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,378 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-11 22:11:12,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:11:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-10-11 22:11:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 22:11:12,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,379 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:11:12,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:12,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash -648778927, now seen corresponding path program 1 times [2024-10-11 22:11:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237479585] [2024-10-11 22:11:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 22:11:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237479585] [2024-10-11 22:11:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237479585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:11:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312095950] [2024-10-11 22:11:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:11:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:11:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:12,484 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:11:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,507 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-10-11 22:11:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:11:12,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-11 22:11:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,508 INFO L225 Difference]: With dead ends: 48 [2024-10-11 22:11:12,509 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 22:11:12,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:12,510 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 22:11:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 22:11:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 22:11:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-11 22:11:12,518 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 20 [2024-10-11 22:11:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,518 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-11 22:11:12,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:11:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-11 22:11:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 22:11:12,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,519 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:11:12,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -648286383, now seen corresponding path program 1 times [2024-10-11 22:11:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439429298] [2024-10-11 22:11:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 22:11:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439429298] [2024-10-11 22:11:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439429298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:11:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862875944] [2024-10-11 22:11:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:11:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:11:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:12,602 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:11:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,621 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2024-10-11 22:11:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:11:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-11 22:11:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,623 INFO L225 Difference]: With dead ends: 47 [2024-10-11 22:11:12,623 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 22:11:12,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:12,624 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 22:11:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 22:11:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 22:11:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-10-11 22:11:12,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 20 [2024-10-11 22:11:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,630 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-11 22:11:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:11:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-10-11 22:11:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 22:11:12,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,631 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:11:12,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:12,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1433936301, now seen corresponding path program 1 times [2024-10-11 22:11:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267567153] [2024-10-11 22:11:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 22:11:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267567153] [2024-10-11 22:11:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267567153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:12,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455611964] [2024-10-11 22:11:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,728 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,767 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-11 22:11:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-10-11 22:11:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,769 INFO L225 Difference]: With dead ends: 46 [2024-10-11 22:11:12,769 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 22:11:12,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,771 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 22:11:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 22:11:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 22:11:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-11 22:11:12,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 36 [2024-10-11 22:11:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,788 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-11 22:11:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-11 22:11:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 22:11:12,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:12,790 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:11:12,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:12,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1433936045, now seen corresponding path program 1 times [2024-10-11 22:11:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556189868] [2024-10-11 22:11:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 22:11:12,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:12,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556189868] [2024-10-11 22:11:12,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556189868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:12,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:12,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959889361] [2024-10-11 22:11:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:12,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,928 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:12,957 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-11 22:11:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-10-11 22:11:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:12,958 INFO L225 Difference]: With dead ends: 42 [2024-10-11 22:11:12,959 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:11:12,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:12,962 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:12,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:11:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:11:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:11:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:11:12,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-10-11 22:11:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:12,964 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:11:12,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:11:12,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:11:12,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:11:12,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:11:12,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:11:12,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:11:12,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:11:12,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:11:12,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:11:12,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:11:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:11:12,977 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 22:11:12,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:11:13,026 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:11:13,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:11:13 BoogieIcfgContainer [2024-10-11 22:11:13,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:11:13,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:11:13,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:11:13,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:11:13,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:11" (3/4) ... [2024-10-11 22:11:13,053 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:11:13,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:11:13,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrueOrFalse [2024-10-11 22:11:13,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:11:13,065 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 22:11:13,065 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 22:11:13,065 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:11:13,066 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:11:13,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:11:13,170 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:11:13,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:11:13,170 INFO L158 Benchmark]: Toolchain (without parser) took 3505.60ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 92.7MB in the beginning and 75.3MB in the end (delta: 17.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:13,170 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:11:13,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1106.06ms. Allocated memory is still 138.4MB. Free memory was 92.7MB in the beginning and 65.8MB in the end (delta: 26.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-10-11 22:11:13,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.80ms. Allocated memory is still 138.4MB. Free memory was 65.8MB in the beginning and 63.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:13,171 INFO L158 Benchmark]: Boogie Preprocessor took 54.99ms. Allocated memory is still 138.4MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:13,171 INFO L158 Benchmark]: RCFGBuilder took 470.97ms. Allocated memory is still 138.4MB. Free memory was 61.1MB in the beginning and 43.5MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 22:11:13,172 INFO L158 Benchmark]: TraceAbstraction took 1684.72ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 42.6MB in the beginning and 81.5MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:11:13,172 INFO L158 Benchmark]: Witness Printer took 120.39ms. Allocated memory is still 174.1MB. Free memory was 81.5MB in the beginning and 75.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 22:11:13,174 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1106.06ms. Allocated memory is still 138.4MB. Free memory was 92.7MB in the beginning and 65.8MB in the end (delta: 26.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.80ms. Allocated memory is still 138.4MB. Free memory was 65.8MB in the beginning and 63.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.99ms. Allocated memory is still 138.4MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.97ms. Allocated memory is still 138.4MB. Free memory was 61.1MB in the beginning and 43.5MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1684.72ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 42.6MB in the beginning and 81.5MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 120.39ms. Allocated memory is still 174.1MB. Free memory was 81.5MB in the beginning and 75.3MB in the end (delta: 6.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: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 788 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 309 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 32/32 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 22:11:13,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE