./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/CWE191_Integer_Underflow__int_min_postdec_06_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d 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/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_06_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash d1245ec8894036eaffca11ad2ccc2a8c92f80d23df1534a71f87dd72e97ad45e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:59:44,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:59:44,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:59:44,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:59:44,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:59:44,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:59:44,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:59:44,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:59:44,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:59:44,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:59:44,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:59:44,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:59:44,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:59:44,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:59:44,656 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:59:44,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:59:44,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:59:44,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:59:44,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:59:44,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:59:44,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:59:44,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:59:44,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:59:44,661 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:59:44,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:59:44,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:59:44,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:59:44,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:59:44,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:59:44,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:59:44,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:59:44,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:59:44,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:59:44,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:59:44,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:59:44,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:59:44,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:59:44,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:59:44,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:59:44,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:59:44,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:59:44,666 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1245ec8894036eaffca11ad2ccc2a8c92f80d23df1534a71f87dd72e97ad45e [2024-10-13 15:59:44,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:59:44,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:59:44,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:59:44,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:59:44,939 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:59:44,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_06_good.i [2024-10-13 15:59:46,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:59:46,693 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:59:46,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_06_good.i [2024-10-13 15:59:46,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7c8215c/7dd1f69bb11949ec9964cc9c097b23b7/FLAG429216f70 [2024-10-13 15:59:46,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7c8215c/7dd1f69bb11949ec9964cc9c097b23b7 [2024-10-13 15:59:46,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:59:46,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:59:46,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:59:46,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:59:46,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:59:46,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:59:46" (1/1) ... [2024-10-13 15:59:46,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb09b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:46, skipping insertion in model container [2024-10-13 15:59:46,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:59:46" (1/1) ... [2024-10-13 15:59:46,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:59:47,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:59:47,566 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:59:47,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:59:47,775 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:59:47,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47 WrapperNode [2024-10-13 15:59:47,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:59:47,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:59:47,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:59:47,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:59:47,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,853 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2024-10-13 15:59:47,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:59:47,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:59:47,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:59:47,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:59:47,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,893 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:59:47,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:59:47,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:59:47,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:59:47,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:59:47,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (1/1) ... [2024-10-13 15:59:47,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:59:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:59:47,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:59:47,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:59:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:59:48,013 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:59:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:59:48,013 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:59:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:59:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:59:48,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:59:48,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:59:48,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:59:48,413 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-13 15:59:48,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:59:48,441 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:59:48,441 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:59:48,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:48 BoogieIcfgContainer [2024-10-13 15:59:48,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:59:48,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:59:48,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:59:48,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:59:48,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:59:46" (1/3) ... [2024-10-13 15:59:48,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a941d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:59:48, skipping insertion in model container [2024-10-13 15:59:48,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:59:47" (2/3) ... [2024-10-13 15:59:48,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a941d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:59:48, skipping insertion in model container [2024-10-13 15:59:48,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:48" (3/3) ... [2024-10-13 15:59:48,452 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_06_good.i [2024-10-13 15:59:48,471 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:59:48,471 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 15:59:48,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:59:48,553 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;@40f2e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:59:48,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 15:59:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 15:59:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 15:59:48,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:48,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:48,567 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-13 15:59:48,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1905490627, now seen corresponding path program 1 times [2024-10-13 15:59:48,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:48,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065414357] [2024-10-13 15:59:48,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:48,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:59:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065414357] [2024-10-13 15:59:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065414357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:48,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:48,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482256039] [2024-10-13 15:59:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:48,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:48,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:48,905 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:48,955 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2024-10-13 15:59:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 15:59:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:48,969 INFO L225 Difference]: With dead ends: 111 [2024-10-13 15:59:48,969 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 15:59:48,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 15:59:48,977 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:48,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 15:59:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-10-13 15:59:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5) internal successors, (54), 43 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 15:59:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-13 15:59:49,011 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 11 [2024-10-13 15:59:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-13 15:59:49,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-13 15:59:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 15:59:49,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:49,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:49,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:59:49,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:49,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1905431045, now seen corresponding path program 1 times [2024-10-13 15:59:49,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:49,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164691647] [2024-10-13 15:59:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:59:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164691647] [2024-10-13 15:59:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164691647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:49,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296807811] [2024-10-13 15:59:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:49,119 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:49,161 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2024-10-13 15:59:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:49,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 15:59:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:49,163 INFO L225 Difference]: With dead ends: 90 [2024-10-13 15:59:49,163 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 15:59:49,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 15:59:49,165 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:49,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 36 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 15:59:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 15:59:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 15:59:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-13 15:59:49,182 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2024-10-13 15:59:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-13 15:59:49,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:59:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-10-13 15:59:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 15:59:49,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:49,183 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:49,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:59:49,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -56135982, now seen corresponding path program 1 times [2024-10-13 15:59:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:49,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799357768] [2024-10-13 15:59:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:59:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:59:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799357768] [2024-10-13 15:59:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799357768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038425638] [2024-10-13 15:59:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:49,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:59:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:59:49,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:59:49,296 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:49,316 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-13 15:59:49,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:59:49,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-13 15:59:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:49,318 INFO L225 Difference]: With dead ends: 60 [2024-10-13 15:59:49,318 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 15:59:49,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 15:59:49,320 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:49,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 15:59:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 15:59:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 15:59:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-13 15:59:49,333 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2024-10-13 15:59:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-13 15:59:49,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:59:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-13 15:59:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 15:59:49,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:49,335 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:59:49,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:49,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash 635592250, now seen corresponding path program 1 times [2024-10-13 15:59:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184049700] [2024-10-13 15:59:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:59:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 15:59:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,440 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-13 15:59:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184049700] [2024-10-13 15:59:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184049700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:49,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:49,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384383178] [2024-10-13 15:59:49,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:49,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:49,447 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-13 15:59:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:49,476 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-13 15:59:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:49,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 30 [2024-10-13 15:59:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:49,478 INFO L225 Difference]: With dead ends: 36 [2024-10-13 15:59:49,478 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 15:59:49,479 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-13 15:59:49,480 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:49,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 15:59:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 15:59:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 15:59:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-13 15:59:49,490 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2024-10-13 15:59:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,490 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-13 15:59:49,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-13 15:59:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-13 15:59:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 15:59:49,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:49,492 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:49,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:59:49,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:49,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1771476616, now seen corresponding path program 1 times [2024-10-13 15:59:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738435620] [2024-10-13 15:59:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:59:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 15:59:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,566 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-13 15:59:49,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:49,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738435620] [2024-10-13 15:59:49,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738435620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:49,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:49,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791879839] [2024-10-13 15:59:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:49,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:49,568 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-13 15:59:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:49,584 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-13 15:59:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 31 [2024-10-13 15:59:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:49,585 INFO L225 Difference]: With dead ends: 35 [2024-10-13 15:59:49,585 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 15:59:49,585 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-13 15:59:49,586 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:49,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 15:59:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 15:59:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 15:59:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-13 15:59:49,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2024-10-13 15:59:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,590 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-13 15:59:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-13 15:59:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-13 15:59:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 15:59:49,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:49,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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-13 15:59:49,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 15:59:49,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:49,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1596033387, now seen corresponding path program 1 times [2024-10-13 15:59:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785411195] [2024-10-13 15:59:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:59:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 15:59:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:59:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,668 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-13 15:59:49,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785411195] [2024-10-13 15:59:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785411195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411960594] [2024-10-13 15:59:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:49,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:49,670 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:49,689 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 15:59:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-13 15:59:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:49,690 INFO L225 Difference]: With dead ends: 34 [2024-10-13 15:59:49,690 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 15:59:49,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-13 15:59:49,691 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:49,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 15:59:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 15:59:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 15:59:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-13 15:59:49,694 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 39 [2024-10-13 15:59:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,694 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-13 15:59:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-13 15:59:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 15:59:49,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:59:49,695 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-13 15:59:49,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 15:59:49,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:59:49,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:59:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2062572688, now seen corresponding path program 1 times [2024-10-13 15:59:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:59:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047733858] [2024-10-13 15:59:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:59:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:59:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:59:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:59:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 15:59:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:59:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:59:49,754 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-13 15:59:49,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:59:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047733858] [2024-10-13 15:59:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047733858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:59:49,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:59:49,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:59:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357539129] [2024-10-13 15:59:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:59:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 15:59:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:59:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 15:59:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 15:59:49,756 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:59:49,766 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-13 15:59:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 15:59:49,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-13 15:59:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:59:49,767 INFO L225 Difference]: With dead ends: 33 [2024-10-13 15:59:49,767 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:59:49,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-13 15:59:49,768 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:59:49,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:59:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:59:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:59:49,769 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-13 15:59:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:59:49,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-10-13 15:59:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:59:49,769 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:59:49,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:59:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:59:49,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:59:49,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 15:59:49,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 15:59:49,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 15:59:49,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 15:59:49,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 15:59:49,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 15:59:49,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 15:59:49,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 15:59:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 15:59:49,776 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:59:49,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:59:49,803 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:59:49,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:59:49 BoogieIcfgContainer [2024-10-13 15:59:49,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:59:49,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:59:49,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:59:49,814 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:59:49,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:59:48" (3/4) ... [2024-10-13 15:59:49,816 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:59:49,818 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:59:49,819 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:59:49,823 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 15:59:49,823 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 15:59:49,823 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 15:59:49,823 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:59:49,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 15:59:49,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 15:59:49,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:59:49,920 INFO L158 Benchmark]: Toolchain (without parser) took 3170.86ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 59.5MB in the beginning and 113.7MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:59:49,920 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:59:49,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1025.94ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 59.3MB in the beginning and 97.3MB in the end (delta: -38.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-13 15:59:49,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.49ms. Allocated memory is still 186.6MB. Free memory was 97.3MB in the beginning and 94.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:49,921 INFO L158 Benchmark]: Boogie Preprocessor took 67.62ms. Allocated memory is still 186.6MB. Free memory was 94.4MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:59:49,921 INFO L158 Benchmark]: RCFGBuilder took 517.05ms. Allocated memory is still 186.6MB. Free memory was 92.2MB in the beginning and 141.3MB in the end (delta: -49.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 15:59:49,921 INFO L158 Benchmark]: TraceAbstraction took 1370.08ms. Allocated memory is still 186.6MB. Free memory was 141.3MB in the beginning and 120.0MB in the end (delta: 21.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-10-13 15:59:49,921 INFO L158 Benchmark]: Witness Printer took 104.80ms. Allocated memory is still 186.6MB. Free memory was 119.0MB in the beginning and 113.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:59:49,923 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.18ms. Allocated memory is still 134.2MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1025.94ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 59.3MB in the beginning and 97.3MB in the end (delta: -38.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.49ms. Allocated memory is still 186.6MB. Free memory was 97.3MB in the beginning and 94.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.62ms. Allocated memory is still 186.6MB. Free memory was 94.4MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.05ms. Allocated memory is still 186.6MB. Free memory was 92.2MB in the beginning and 141.3MB in the end (delta: -49.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1370.08ms. Allocated memory is still 186.6MB. Free memory was 141.3MB in the beginning and 120.0MB in the end (delta: 21.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 104.80ms. Allocated memory is still 186.6MB. Free memory was 119.0MB in the beginning and 113.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: 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 3 procedures, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 265 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 52/52 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-13 15:59:49,957 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