./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_17_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9d228c73e9bb280a145779c6620e7e3557451cb163a0ff20f80c38a6902c4393 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:22:05,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:22:05,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:22:05,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:22:05,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:22:05,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:22:05,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:22:05,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:22:05,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:22:05,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:22:05,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:22:05,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:22:05,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:22:05,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:22:05,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:22:05,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:22:05,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:22:05,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:22:05,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:22:05,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:22:05,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:22:05,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:22:05,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:22:05,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:22:05,857 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d228c73e9bb280a145779c6620e7e3557451cb163a0ff20f80c38a6902c4393 [2025-03-09 05:22:06,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:22:06,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:22:06,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:22:06,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:22:06,089 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:22:06,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_17_good.i [2025-03-09 05:22:07,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0062fd237/704e969230f04222b2144bea81240fff/FLAGebc51fe02 [2025-03-09 05:22:07,601 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:22:07,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_17_good.i [2025-03-09 05:22:07,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0062fd237/704e969230f04222b2144bea81240fff/FLAGebc51fe02 [2025-03-09 05:22:07,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0062fd237/704e969230f04222b2144bea81240fff [2025-03-09 05:22:07,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:22:07,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:22:07,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:22:07,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:22:07,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:22:07,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:22:07" (1/1) ... [2025-03-09 05:22:07,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0d3e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:07, skipping insertion in model container [2025-03-09 05:22:07,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:22:07" (1/1) ... [2025-03-09 05:22:07,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:22:08,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:22:08,276 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:22:08,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:22:08,408 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:22:08,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08 WrapperNode [2025-03-09 05:22:08,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:22:08,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:22:08,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:22:08,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:22:08,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,448 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-03-09 05:22:08,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:22:08,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:22:08,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:22:08,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:22:08,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,466 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:22:08,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:22:08,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:22:08,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:22:08,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:22:08,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (1/1) ... [2025-03-09 05:22:08,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:22:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:08,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:22:08,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:22:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 05:22:08,516 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 05:22:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:22:08,516 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:22:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:22:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:22:08,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:22:08,609 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:22:08,611 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:22:08,762 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-09 05:22:08,762 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:22:08,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:22:08,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:22:08,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:22:08 BoogieIcfgContainer [2025-03-09 05:22:08,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:22:08,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:22:08,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:22:08,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:22:08,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:22:07" (1/3) ... [2025-03-09 05:22:08,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b180e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:22:08, skipping insertion in model container [2025-03-09 05:22:08,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:08" (2/3) ... [2025-03-09 05:22:08,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b180e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:22:08, skipping insertion in model container [2025-03-09 05:22:08,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:22:08" (3/3) ... [2025-03-09 05:22:08,780 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_17_good.i [2025-03-09 05:22:08,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:22:08,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_multiply_17_good.i that has 3 procedures, 57 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 05:22:08,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:22:08,849 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;@33b046ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:22:08,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 05:22:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:22:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 05:22:08,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:08,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:08,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:08,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1006996017, now seen corresponding path program 1 times [2025-03-09 05:22:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797539888] [2025-03-09 05:22:08,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:08,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 05:22:08,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 05:22:08,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:22:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797539888] [2025-03-09 05:22:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797539888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:22:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426094782] [2025-03-09 05:22:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:22:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:09,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:22:09,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:09,108 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-09 05:22:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:09,149 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2025-03-09 05:22:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:22:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2025-03-09 05:22:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:09,156 INFO L225 Difference]: With dead ends: 110 [2025-03-09 05:22:09,156 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 05:22:09,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:09,160 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:09,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 185 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 05:22:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 05:22:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-03-09 05:22:09,184 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 10 [2025-03-09 05:22:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-03-09 05:22:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-09 05:22:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-03-09 05:22:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:22:09,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:09,185 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:09,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:22:09,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:09,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 928243078, now seen corresponding path program 1 times [2025-03-09 05:22:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:09,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745715955] [2025-03-09 05:22:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:09,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:22:09,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:22:09,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:09,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:22:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745715955] [2025-03-09 05:22:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745715955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354333924] [2025-03-09 05:22:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:09,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:09,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:22:09,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:22:09,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:22:09,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:09,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:22:09,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:22:09,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354333924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:09,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 05:22:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94249998] [2025-03-09 05:22:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:09,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:22:09,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:09,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:22:09,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:09,416 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2025-03-09 05:22:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:09,442 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-03-09 05:22:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:22:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-03-09 05:22:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:09,445 INFO L225 Difference]: With dead ends: 95 [2025-03-09 05:22:09,445 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 05:22:09,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:09,446 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:09,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 05:22:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 05:22:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 43 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-09 05:22:09,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 13 [2025-03-09 05:22:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:09,455 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-09 05:22:09,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2025-03-09 05:22:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-09 05:22:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:22:09,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:09,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:09,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:22:09,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:09,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:09,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2009630999, now seen corresponding path program 1 times [2025-03-09 05:22:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056327331] [2025-03-09 05:22:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:09,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:22:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:22:09,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:22:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056327331] [2025-03-09 05:22:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056327331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:09,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:09,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473693116] [2025-03-09 05:22:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:09,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:09,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:09,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:09,724 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-03-09 05:22:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:09,754 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2025-03-09 05:22:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-03-09 05:22:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:09,757 INFO L225 Difference]: With dead ends: 98 [2025-03-09 05:22:09,757 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 05:22:09,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:09,758 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:09,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 05:22:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-03-09 05:22:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 47 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-09 05:22:09,766 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 16 [2025-03-09 05:22:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:09,766 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-09 05:22:09,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-03-09 05:22:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-09 05:22:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:22:09,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:09,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:09,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:22:09,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:09,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2009630293, now seen corresponding path program 1 times [2025-03-09 05:22:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:09,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007125115] [2025-03-09 05:22:09,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:09,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:22:09,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:22:09,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:09,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:22:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007125115] [2025-03-09 05:22:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007125115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:22:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366899788] [2025-03-09 05:22:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:22:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:09,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:22:09,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:09,822 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-09 05:22:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:09,854 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2025-03-09 05:22:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:22:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2025-03-09 05:22:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:09,855 INFO L225 Difference]: With dead ends: 93 [2025-03-09 05:22:09,855 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 05:22:09,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:09,856 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:09,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 05:22:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-09 05:22:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 59 states have internal predecessors, (73), 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) [2025-03-09 05:22:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-09 05:22:09,861 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 16 [2025-03-09 05:22:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:09,861 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-09 05:22:09,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-09 05:22:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-09 05:22:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 05:22:09,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:09,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:22:09,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2125948482, now seen corresponding path program 1 times [2025-03-09 05:22:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788343647] [2025-03-09 05:22:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:09,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 05:22:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 05:22:09,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:22:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788343647] [2025-03-09 05:22:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788343647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469741452] [2025-03-09 05:22:09,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:09,896 INFO L87 Difference]: Start difference. First operand 68 states and 85 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) [2025-03-09 05:22:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:09,915 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2025-03-09 05:22:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:09,915 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 [2025-03-09 05:22:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:09,917 INFO L225 Difference]: With dead ends: 113 [2025-03-09 05:22:09,917 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 05:22:09,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:09,917 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 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 [2025-03-09 05:22:09,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 05:22:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-03-09 05:22:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 66 states have internal predecessors, (81), 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) [2025-03-09 05:22:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2025-03-09 05:22:09,929 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 17 [2025-03-09 05:22:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:09,929 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2025-03-09 05:22:09,929 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) [2025-03-09 05:22:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2025-03-09 05:22:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 05:22:09,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:09,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 05:22:09,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1600481546, now seen corresponding path program 1 times [2025-03-09 05:22:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741487436] [2025-03-09 05:22:09,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:09,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 05:22:09,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 05:22:09,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:09,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:22:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741487436] [2025-03-09 05:22:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741487436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547477361] [2025-03-09 05:22:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:09,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:09,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:09,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:09,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:22:10,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 05:22:10,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 05:22:10,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:22:10,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:22:10,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547477361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 05:22:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724205142] [2025-03-09 05:22:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:22:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:10,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:22:10,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:10,081 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2025-03-09 05:22:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:10,110 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2025-03-09 05:22:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:22:10,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 21 [2025-03-09 05:22:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:10,112 INFO L225 Difference]: With dead ends: 104 [2025-03-09 05:22:10,112 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 05:22:10,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:10,112 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:10,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 137 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 05:22:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-03-09 05:22:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-09 05:22:10,119 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 21 [2025-03-09 05:22:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-09 05:22:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2025-03-09 05:22:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-09 05:22:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 05:22:10,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:10,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:10,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 05:22:10,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 05:22:10,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:10,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1600467323, now seen corresponding path program 1 times [2025-03-09 05:22:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:10,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130342882] [2025-03-09 05:22:10,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:10,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 05:22:10,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 05:22:10,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:22:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130342882] [2025-03-09 05:22:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130342882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:22:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408400445] [2025-03-09 05:22:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:10,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:22:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:10,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:22:10,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:10,377 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (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) [2025-03-09 05:22:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:10,397 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-03-09 05:22:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:22:10,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (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 21 [2025-03-09 05:22:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:10,398 INFO L225 Difference]: With dead ends: 67 [2025-03-09 05:22:10,398 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 05:22:10,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:10,399 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:10,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 05:22:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 05:22:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-09 05:22:10,408 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 21 [2025-03-09 05:22:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:10,409 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-09 05:22:10,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (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) [2025-03-09 05:22:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-09 05:22:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 05:22:10,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:10,409 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:10,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:22:10,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:10,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1090068457, now seen corresponding path program 1 times [2025-03-09 05:22:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:10,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771478595] [2025-03-09 05:22:10,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:10,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 05:22:10,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 05:22:10,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:22:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771478595] [2025-03-09 05:22:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771478595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861584600] [2025-03-09 05:22:10,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:10,471 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:10,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:22:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 05:22:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 05:22:10,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:22:10,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:22:10,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861584600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 05:22:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028485284] [2025-03-09 05:22:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:10,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:22:10,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:10,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:22:10,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:10,551 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2025-03-09 05:22:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:10,572 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-03-09 05:22:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:22:10,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 24 [2025-03-09 05:22:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:10,575 INFO L225 Difference]: With dead ends: 66 [2025-03-09 05:22:10,575 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 05:22:10,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:10,575 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:10,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 05:22:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 05:22:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-09 05:22:10,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 24 [2025-03-09 05:22:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:10,579 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-09 05:22:10,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2025-03-09 05:22:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-09 05:22:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 05:22:10,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:10,580 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:22:10,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:22:10,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:10,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 416079061, now seen corresponding path program 1 times [2025-03-09 05:22:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:10,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802827467] [2025-03-09 05:22:10,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 05:22:10,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 05:22:10,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:22:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:10,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802827467] [2025-03-09 05:22:10,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802827467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:10,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:10,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067033402] [2025-03-09 05:22:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:10,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:10,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:10,808 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-09 05:22:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:10,818 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-09 05:22:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 26 [2025-03-09 05:22:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:10,819 INFO L225 Difference]: With dead ends: 45 [2025-03-09 05:22:10,819 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 05:22:10,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:10,819 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:10,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 05:22:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 05:22:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-09 05:22:10,823 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 26 [2025-03-09 05:22:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:10,823 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-09 05:22:10,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-09 05:22:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-09 05:22:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:22:10,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:10,824 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:22:10,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:22:10,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 13548992, now seen corresponding path program 1 times [2025-03-09 05:22:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576692553] [2025-03-09 05:22:10,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:22:10,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:22:10,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:22:10,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576692553] [2025-03-09 05:22:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576692553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:10,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:10,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457921483] [2025-03-09 05:22:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:10,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:10,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:10,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:10,850 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-03-09 05:22:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:10,857 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-03-09 05:22:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2025-03-09 05:22:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:10,858 INFO L225 Difference]: With dead ends: 58 [2025-03-09 05:22:10,858 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 05:22:10,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:10,859 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:10,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 05:22:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 05:22:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:22:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-09 05:22:10,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2025-03-09 05:22:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-09 05:22:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2025-03-09 05:22:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-09 05:22:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 05:22:10,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:10,868 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:22:10,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:22:10,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1346388785, now seen corresponding path program 1 times [2025-03-09 05:22:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113258068] [2025-03-09 05:22:10,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:10,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 05:22:10,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 05:22:10,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 05:22:10,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113258068] [2025-03-09 05:22:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113258068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:10,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:22:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454075650] [2025-03-09 05:22:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:22:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:22:10,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:10,921 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:22:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:10,940 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-03-09 05:22:10,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:22:10,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-03-09 05:22:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:10,942 INFO L225 Difference]: With dead ends: 54 [2025-03-09 05:22:10,942 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 05:22:10,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:22:10,942 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:10,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 05:22:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 05:22:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:22:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-09 05:22:10,948 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 34 [2025-03-09 05:22:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:10,949 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-09 05:22:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:22:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-09 05:22:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 05:22:10,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:10,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:10,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:22:10,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 05:22:10,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash 566751160, now seen corresponding path program 1 times [2025-03-09 05:22:10,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:10,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876735263] [2025-03-09 05:22:10,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:10,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 05:22:10,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 05:22:10,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:10,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 05:22:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876735263] [2025-03-09 05:22:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876735263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925567011] [2025-03-09 05:22:11,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:11,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:11,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:11,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:11,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:22:11,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 05:22:11,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 05:22:11,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:11,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:11,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:22:11,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 05:22:11,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925567011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 05:22:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024481289] [2025-03-09 05:22:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:22:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:22:11,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:11,118 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:22:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:11,132 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-09 05:22:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:22:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2025-03-09 05:22:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:11,133 INFO L225 Difference]: With dead ends: 56 [2025-03-09 05:22:11,133 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 05:22:11,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:22:11,134 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:11,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 05:22:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 05:22:11,135 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) [2025-03-09 05:22:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 05:22:11,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-03-09 05:22:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:11,135 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 05:22:11,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:22:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 05:22:11,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 05:22:11,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 05:22:11,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 05:22:11,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:22:11,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:11,341 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:11,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 05:22:11,410 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:22:11,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:22:11 BoogieIcfgContainer [2025-03-09 05:22:11,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:22:11,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:22:11,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:22:11,420 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:22:11,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:22:08" (3/4) ... [2025-03-09 05:22:11,421 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 05:22:11,430 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 05:22:11,431 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 05:22:11,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 05:22:11,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 05:22:11,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 05:22:11,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:22:11,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:22:11,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:22:11,488 INFO L158 Benchmark]: Toolchain (without parser) took 3693.36ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 102.6MB in the end (delta: 17.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2025-03-09 05:22:11,488 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:22:11,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.58ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 59.6MB in the end (delta: 60.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 05:22:11,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.29ms. Allocated memory is still 167.8MB. Free memory was 59.6MB in the beginning and 56.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:22:11,489 INFO L158 Benchmark]: Boogie Preprocessor took 22.58ms. Allocated memory is still 167.8MB. Free memory was 56.2MB in the beginning and 55.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:22:11,489 INFO L158 Benchmark]: IcfgBuilder took 298.81ms. Allocated memory is still 167.8MB. Free memory was 55.2MB in the beginning and 39.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 05:22:11,490 INFO L158 Benchmark]: TraceAbstraction took 2646.04ms. Allocated memory is still 167.8MB. Free memory was 39.8MB in the beginning and 109.5MB in the end (delta: -69.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:22:11,490 INFO L158 Benchmark]: Witness Printer took 65.70ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 102.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:22:11,490 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.24ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.58ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 59.6MB in the end (delta: 60.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.29ms. Allocated memory is still 167.8MB. Free memory was 59.6MB in the beginning and 56.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.58ms. Allocated memory is still 167.8MB. Free memory was 56.2MB in the beginning and 55.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 298.81ms. Allocated memory is still 167.8MB. Free memory was 55.2MB in the beginning and 39.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2646.04ms. Allocated memory is still 167.8MB. Free memory was 39.8MB in the beginning and 109.5MB in the end (delta: -69.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.70ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 102.6MB in the end (delta: 6.9MB). 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: 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, 57 locations, 72 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 1646 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1041 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 605 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 48, 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, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 60/64 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((0 <= ((long) 1073741823 + data)) && (i == 0)) || (0 < i)) - InvariantResult [Line: 1557]: Location Invariant Derived location invariant: ((k == 0) || (1 <= k)) - InvariantResult [Line: 1582]: Location Invariant Derived location invariant: (((j == 0) && (((long) data + 2) == 0)) || ((1 <= j) && (((long) data + 2) == 0))) - InvariantResult [Line: 1578]: Location Invariant Derived location invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) RESULT: Ultimate proved your program to be correct! [2025-03-09 05:22:11,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE