./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_rand_predec_07_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/CWE191_Integer_Underflow__int_rand_predec_07_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 8a76a470609d71737fc5c88cc2b5510cb8c165c4ddb4681d6c11879344e9cb01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:20:45,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:20:45,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:20:45,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:20:45,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:20:45,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:20:45,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:20:45,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:20:45,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:20:45,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:20:45,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:20:45,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:20:45,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:20:45,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:20:45,459 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:20:45,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:20:45,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:20:45,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:20:45,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:20:45,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:20:45,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:20:45,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:20:45,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:20:45,465 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:20:45,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:20:45,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:20:45,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:20:45,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:20:45,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:20:45,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:20:45,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:20:45,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:20:45,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:20:45,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:20:45,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:20:45,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:20:45,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:20:45,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:20:45,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:20:45,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:20:45,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:20:45,472 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 -> 8a76a470609d71737fc5c88cc2b5510cb8c165c4ddb4681d6c11879344e9cb01 [2024-10-11 23:20:45,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:20:45,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:20:45,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:20:45,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:20:45,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:20:45,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_07_good.i [2024-10-11 23:20:47,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:20:47,635 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:20:47,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_07_good.i [2024-10-11 23:20:47,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff1670943/471711a9e60546d8b9a028470ae1956d/FLAGebc63e1dc [2024-10-11 23:20:47,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff1670943/471711a9e60546d8b9a028470ae1956d [2024-10-11 23:20:47,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:20:47,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:20:47,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:20:47,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:20:47,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:20:47,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:47" (1/1) ... [2024-10-11 23:20:47,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2003e876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:47, skipping insertion in model container [2024-10-11 23:20:47,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:47" (1/1) ... [2024-10-11 23:20:47,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:20:48,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:20:48,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:20:48,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:20:49,072 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:20:49,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49 WrapperNode [2024-10-11 23:20:49,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:20:49,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:20:49,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:20:49,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:20:49,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,149 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 218 [2024-10-11 23:20:49,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:20:49,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:20:49,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:20:49,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:20:49,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,194 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:20:49,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:20:49,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:20:49,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:20:49,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:20:49,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (1/1) ... [2024-10-11 23:20:49,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:20:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:49,264 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 23:20:49,267 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 23:20:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:20:49,328 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:20:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:20:49,331 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:20:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:20:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:20:49,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:20:49,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:20:49,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:20:49,856 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-11 23:20:49,856 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:20:49,887 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:20:49,887 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:20:49,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:49 BoogieIcfgContainer [2024-10-11 23:20:49,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:20:49,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:20:49,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:20:49,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:20:49,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:20:47" (1/3) ... [2024-10-11 23:20:49,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eeee28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:49, skipping insertion in model container [2024-10-11 23:20:49,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:49" (2/3) ... [2024-10-11 23:20:49,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eeee28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:49, skipping insertion in model container [2024-10-11 23:20:49,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:49" (3/3) ... [2024-10-11 23:20:49,904 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_07_good.i [2024-10-11 23:20:49,923 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:20:49,923 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 23:20:49,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:20:49,989 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;@b76ac37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:20:49,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 23:20:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 89 states have internal predecessors, (126), 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-11 23:20:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 23:20:50,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:50,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:50,015 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 23:20:50,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1185570845, now seen corresponding path program 1 times [2024-10-11 23:20:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104474012] [2024-10-11 23:20:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104474012] [2024-10-11 23:20:50,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104474012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:50,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480916462] [2024-10-11 23:20:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:50,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:50,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:50,370 INFO L87 Difference]: Start difference. First operand has 102 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 89 states have internal predecessors, (126), 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-11 23:20:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:50,442 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2024-10-11 23:20:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:50,444 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-11 23:20:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:50,450 INFO L225 Difference]: With dead ends: 174 [2024-10-11 23:20:50,450 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 23:20:50,453 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-11 23:20:50,456 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:50,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 23:20:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 23:20:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 83 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2024-10-11 23:20:50,497 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 11 [2024-10-11 23:20:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:50,499 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-10-11 23:20:50,499 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-11 23:20:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2024-10-11 23:20:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 23:20:50,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:50,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:50,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:20:50,504 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-11 23:20:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -602908448, now seen corresponding path program 1 times [2024-10-11 23:20:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463852517] [2024-10-11 23:20:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:50,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463852517] [2024-10-11 23:20:50,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463852517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:50,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856668441] [2024-10-11 23:20:50,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:50,626 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:20:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:50,670 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2024-10-11 23:20:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-10-11 23:20:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:50,672 INFO L225 Difference]: With dead ends: 92 [2024-10-11 23:20:50,673 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 23:20:50,674 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-11 23:20:50,676 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:50,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 23:20:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 23:20:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 82 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-10-11 23:20:50,692 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 17 [2024-10-11 23:20:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:50,692 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-10-11 23:20:50,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:20:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-10-11 23:20:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 23:20:50,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:50,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:50,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:20:50,694 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 23:20:50,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1510292561, now seen corresponding path program 1 times [2024-10-11 23:20:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167662753] [2024-10-11 23:20:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167662753] [2024-10-11 23:20:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167662753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:50,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:50,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:50,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115426369] [2024-10-11 23:20:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:50,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:50,846 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:20:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:50,878 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2024-10-11 23:20:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-10-11 23:20:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:50,880 INFO L225 Difference]: With dead ends: 91 [2024-10-11 23:20:50,880 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 23:20:50,880 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-11 23:20:50,882 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:50,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 193 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 23:20:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 23:20:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 81 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-11 23:20:50,893 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 18 [2024-10-11 23:20:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:50,894 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-11 23:20:50,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:20:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-11 23:20:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 23:20:50,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:50,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:50,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:20:50,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -829772855, now seen corresponding path program 1 times [2024-10-11 23:20:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585400563] [2024-10-11 23:20:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 23:20:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,075 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-11 23:20:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585400563] [2024-10-11 23:20:51,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585400563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756375175] [2024-10-11 23:20:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,079 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:20:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,108 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-11 23:20:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 33 [2024-10-11 23:20:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,110 INFO L225 Difference]: With dead ends: 90 [2024-10-11 23:20:51,110 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 23:20:51,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 23:20:51,111 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 192 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 23:20:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 23:20:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 80 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-11 23:20:51,124 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2024-10-11 23:20:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,126 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-11 23:20:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:20:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-11 23:20:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 23:20:51,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:20:51,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 46845517, now seen corresponding path program 1 times [2024-10-11 23:20:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440190719] [2024-10-11 23:20:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 23:20:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,284 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-11 23:20:51,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440190719] [2024-10-11 23:20:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440190719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150470938] [2024-10-11 23:20:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,288 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:20:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,320 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-11 23:20:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 34 [2024-10-11 23:20:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,323 INFO L225 Difference]: With dead ends: 89 [2024-10-11 23:20:51,323 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 23:20:51,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 23:20:51,326 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 35 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 189 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 23:20:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 23:20:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 79 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-10-11 23:20:51,339 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2024-10-11 23:20:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-10-11 23:20:51,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:20:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-10-11 23:20:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 23:20:51,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:20:51,344 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 23:20:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1824746656, now seen corresponding path program 1 times [2024-10-11 23:20:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450615095] [2024-10-11 23:20:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 23:20:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 23:20:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,443 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-11 23:20:51,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450615095] [2024-10-11 23:20:51,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450615095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153356805] [2024-10-11 23:20:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,448 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 23:20:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,474 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2024-10-11 23:20:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 42 [2024-10-11 23:20:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,475 INFO L225 Difference]: With dead ends: 88 [2024-10-11 23:20:51,475 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 23:20:51,476 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 23:20:51,476 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 23:20:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 23:20:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 78 states have internal predecessors, (107), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-10-11 23:20:51,489 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 42 [2024-10-11 23:20:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,490 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-10-11 23:20:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 23:20:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-10-11 23:20:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 23:20:51,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,497 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:20:51,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash -732571216, now seen corresponding path program 1 times [2024-10-11 23:20:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760885003] [2024-10-11 23:20:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 23:20:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 23:20:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,573 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-11 23:20:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760885003] [2024-10-11 23:20:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760885003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041194768] [2024-10-11 23:20:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,576 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 23:20:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,593 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2024-10-11 23:20:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 43 [2024-10-11 23:20:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,595 INFO L225 Difference]: With dead ends: 87 [2024-10-11 23:20:51,595 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 23:20:51,596 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 23:20:51,597 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 23:20:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 23:20:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-11 23:20:51,606 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 43 [2024-10-11 23:20:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,609 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-11 23:20:51,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 23:20:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-11 23:20:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 23:20:51,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:20:51,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1811930573, now seen corresponding path program 1 times [2024-10-11 23:20:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841804664] [2024-10-11 23:20:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 23:20:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 23:20:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:20:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841804664] [2024-10-11 23:20:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841804664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94335816] [2024-10-11 23:20:51,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,739 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-11 23:20:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,756 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2024-10-11 23:20:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 51 [2024-10-11 23:20:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,759 INFO L225 Difference]: With dead ends: 86 [2024-10-11 23:20:51,760 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 23:20:51,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 23:20:51,761 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 23:20:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 23:20:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-10-11 23:20:51,774 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 51 [2024-10-11 23:20:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,775 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-10-11 23:20:51,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-11 23:20:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-10-11 23:20:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 23:20:51,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:51,776 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:20:51,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:20:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash 335273206, now seen corresponding path program 1 times [2024-10-11 23:20:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798203643] [2024-10-11 23:20:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 23:20:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 23:20:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:20:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798203643] [2024-10-11 23:20:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798203643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490439070] [2024-10-11 23:20:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:51,874 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11 23:20:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:51,888 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2024-10-11 23:20:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:51,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 52 [2024-10-11 23:20:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:51,890 INFO L225 Difference]: With dead ends: 85 [2024-10-11 23:20:51,891 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:20:51,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 23:20:51,892 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:51,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:20:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:20:51,894 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 23:20:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:20:51,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-11 23:20:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:51,894 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:20:51,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11 23:20:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:20:51,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:20:51,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 23:20:51,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 23:20:51,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 23:20:51,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 23:20:51,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 23:20:51,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 23:20:51,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 23:20:51,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 23:20:51,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:20:51,906 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:51,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:20:51,951 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:20:51,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:20:51 BoogieIcfgContainer [2024-10-11 23:20:51,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:20:51,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:20:51,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:20:51,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:20:51,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:49" (3/4) ... [2024-10-11 23:20:51,974 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:20:51,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:20:51,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:20:51,988 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 23:20:51,991 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 23:20:51,992 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:20:51,992 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:20:52,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:20:52,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:20:52,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:20:52,115 INFO L158 Benchmark]: Toolchain (without parser) took 4220.71ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 135.5MB in the beginning and 123.6MB in the end (delta: 11.8MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,116 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:20:52,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1177.72ms. Allocated memory is still 167.8MB. Free memory was 135.5MB in the beginning and 67.2MB in the end (delta: 68.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.62ms. Allocated memory is still 167.8MB. Free memory was 67.2MB in the beginning and 64.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,116 INFO L158 Benchmark]: Boogie Preprocessor took 74.99ms. Allocated memory is still 167.8MB. Free memory was 64.2MB in the beginning and 61.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,116 INFO L158 Benchmark]: RCFGBuilder took 662.12ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 112.5MB in the end (delta: -51.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,117 INFO L158 Benchmark]: TraceAbstraction took 2080.58ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 131.1MB in the end (delta: -18.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,117 INFO L158 Benchmark]: Witness Printer took 143.76ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 123.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 23:20:52,118 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.30ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1177.72ms. Allocated memory is still 167.8MB. Free memory was 135.5MB in the beginning and 67.2MB in the end (delta: 68.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.62ms. Allocated memory is still 167.8MB. Free memory was 67.2MB in the beginning and 64.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.99ms. Allocated memory is still 167.8MB. Free memory was 64.2MB in the beginning and 61.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 662.12ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 112.5MB in the end (delta: -51.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2080.58ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 131.1MB in the end (delta: -18.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 143.76ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 123.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. 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, 102 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 1784 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 746 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1038 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 28/28 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 - ProcedureContractResult [Line: 1412]: Procedure Contract for printLine Derived contract for procedure printLine. Requires: (staticFive == 5) Ensures: (staticFive == 5) - ProcedureContractResult [Line: 1426]: Procedure Contract for printIntLine Derived contract for procedure printIntLine. Requires: (staticFive == 5) Ensures: (staticFive == 5) RESULT: Ultimate proved your program to be correct! [2024-10-11 23:20:52,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE