./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cd40341b80aac7a99d3a91b3bc238a3d4a979d431e9f6b808274406ea6962645 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 03:53:55,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 03:53:55,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 03:53:55,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 03:53:55,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 03:53:55,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 03:53:55,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 03:53:55,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 03:53:55,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 03:53:55,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 03:53:55,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 03:53:55,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 03:53:55,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 03:53:55,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 03:53:55,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 03:53:55,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 03:53:55,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:53:55,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:53:55,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:53:55,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 03:53:55,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 03:53:55,903 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-jdk21/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 -> cd40341b80aac7a99d3a91b3bc238a3d4a979d431e9f6b808274406ea6962645 [2025-01-10 03:53:56,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 03:53:56,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 03:53:56,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 03:53:56,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 03:53:56,205 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 03:53:56,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i [2025-01-10 03:53:57,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e55ac707/5376aa39aaca48699cc3a51b5fa5a560/FLAG2fb27015b [2025-01-10 03:53:57,761 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 03:53:57,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i [2025-01-10 03:53:57,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e55ac707/5376aa39aaca48699cc3a51b5fa5a560/FLAG2fb27015b [2025-01-10 03:53:57,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e55ac707/5376aa39aaca48699cc3a51b5fa5a560 [2025-01-10 03:53:57,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 03:53:57,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 03:53:57,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 03:53:57,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 03:53:57,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 03:53:57,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:57" (1/1) ... [2025-01-10 03:53:57,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5f8a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:57, skipping insertion in model container [2025-01-10 03:53:57,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:57" (1/1) ... [2025-01-10 03:53:57,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 03:53:58,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:53:58,503 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 03:53:58,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:53:58,636 INFO L204 MainTranslator]: Completed translation [2025-01-10 03:53:58,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58 WrapperNode [2025-01-10 03:53:58,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 03:53:58,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 03:53:58,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 03:53:58,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 03:53:58,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,669 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 165 [2025-01-10 03:53:58,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 03:53:58,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 03:53:58,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 03:53:58,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 03:53:58,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,687 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 03:53:58,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 03:53:58,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 03:53:58,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 03:53:58,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 03:53:58,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (1/1) ... [2025-01-10 03:53:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:53:58,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:58,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 03:53:58,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 03:53:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 03:53:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 03:53:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 03:53:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 03:53:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 03:53:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 03:53:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 03:53:58,823 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 03:53:58,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 03:53:59,010 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-01-10 03:53:59,010 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 03:53:59,023 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 03:53:59,023 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 03:53:59,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:59 BoogieIcfgContainer [2025-01-10 03:53:59,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 03:53:59,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 03:53:59,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 03:53:59,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 03:53:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:53:57" (1/3) ... [2025-01-10 03:53:59,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5df47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:59, skipping insertion in model container [2025-01-10 03:53:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:58" (2/3) ... [2025-01-10 03:53:59,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5df47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:59, skipping insertion in model container [2025-01-10 03:53:59,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:59" (3/3) ... [2025-01-10 03:53:59,037 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_add_15_good.i [2025-01-10 03:53:59,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 03:53:59,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_add_15_good.i that has 3 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 03:53:59,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 03:53:59,134 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;@1756bb47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 03:53:59,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 03:53:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 72 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:53:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 03:53:59,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1492055446, now seen corresponding path program 1 times [2025-01-10 03:53:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979050166] [2025-01-10 03:53:59,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 03:53:59,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 03:53:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 03:53:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979050166] [2025-01-10 03:53:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979050166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893724995] [2025-01-10 03:53:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,415 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 72 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 03:53:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,448 INFO L93 Difference]: Finished difference Result 83 states and 115 transitions. [2025-01-10 03:53:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-01-10 03:53:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,455 INFO L225 Difference]: With dead ends: 83 [2025-01-10 03:53:59,455 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 03:53:59,458 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-01-10 03:53:59,460 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 03:53:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-01-10 03:53:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5) internal successors, (69), 61 states have internal predecessors, (69), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 03:53:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2025-01-10 03:53:59,489 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 14 [2025-01-10 03:53:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,490 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2025-01-10 03:53:59,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-10 03:53:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2025-01-10 03:53:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 03:53:59,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 03:53:59,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 990921503, now seen corresponding path program 1 times [2025-01-10 03:53:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239787774] [2025-01-10 03:53:59,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 03:53:59,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 03:53:59,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 03:53:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239787774] [2025-01-10 03:53:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239787774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945897090] [2025-01-10 03:53:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,572 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-01-10 03:53:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,596 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2025-01-10 03:53:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 15 [2025-01-10 03:53:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,598 INFO L225 Difference]: With dead ends: 126 [2025-01-10 03:53:59,598 INFO L226 Difference]: Without dead ends: 74 [2025-01-10 03:53:59,598 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-01-10 03:53:59,599 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 185 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-10 03:53:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-01-10 03:53:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.48) internal successors, (74), 64 states have internal predecessors, (74), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 03:53:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2025-01-10 03:53:59,610 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 15 [2025-01-10 03:53:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,611 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2025-01-10 03:53:59,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-01-10 03:53:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2025-01-10 03:53:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 03:53:59,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 03:53:59,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash -124139516, now seen corresponding path program 1 times [2025-01-10 03:53:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832559905] [2025-01-10 03:53:59,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 03:53:59,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 03:53:59,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 03:53:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832559905] [2025-01-10 03:53:59,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832559905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:53:59,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378781661] [2025-01-10 03:53:59,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,657 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 03:53:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,679 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2025-01-10 03:53:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2025-01-10 03:53:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,680 INFO L225 Difference]: With dead ends: 121 [2025-01-10 03:53:59,680 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 03:53:59,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:53:59,683 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 03:53:59,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-10 03:53:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 03:53:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2025-01-10 03:53:59,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 19 [2025-01-10 03:53:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,696 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2025-01-10 03:53:59,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 03:53:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2025-01-10 03:53:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 03:53:59,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 03:53:59,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1651573367, now seen corresponding path program 1 times [2025-01-10 03:53:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079115464] [2025-01-10 03:53:59,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 03:53:59,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 03:53:59,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 03:53:59,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079115464] [2025-01-10 03:53:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079115464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:53:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907660752] [2025-01-10 03:53:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,744 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 03:53:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,756 INFO L93 Difference]: Finished difference Result 121 states and 165 transitions. [2025-01-10 03:53:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2025-01-10 03:53:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,757 INFO L225 Difference]: With dead ends: 121 [2025-01-10 03:53:59,757 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 03:53:59,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:53:59,758 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 03:53:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 03:53:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.4) internal successors, (70), 63 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 03:53:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2025-01-10 03:53:59,763 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 23 [2025-01-10 03:53:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,764 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-01-10 03:53:59,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 03:53:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2025-01-10 03:53:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 03:53:59,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 03:53:59,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1868040253, now seen corresponding path program 1 times [2025-01-10 03:53:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028298522] [2025-01-10 03:53:59,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 03:53:59,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 03:53:59,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 03:53:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028298522] [2025-01-10 03:53:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028298522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593859868] [2025-01-10 03:53:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,808 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 03:53:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,829 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2025-01-10 03:53:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-01-10 03:53:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,831 INFO L225 Difference]: With dead ends: 72 [2025-01-10 03:53:59,832 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 03:53:59,832 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-01-10 03:53:59,832 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 03:53:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-01-10 03:53:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 03:53:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-01-10 03:53:59,841 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 25 [2025-01-10 03:53:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-01-10 03:53:59,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 03:53:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-01-10 03:53:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 03:53:59,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 03:53:59,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2074673103, now seen corresponding path program 1 times [2025-01-10 03:53:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422262765] [2025-01-10 03:53:59,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 03:53:59,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 03:53:59,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 03:53:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422262765] [2025-01-10 03:53:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422262765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:59,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945703899] [2025-01-10 03:53:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,877 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 03:53:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,902 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2025-01-10 03:53:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 03:53:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,905 INFO L225 Difference]: With dead ends: 110 [2025-01-10 03:53:59,905 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 03:53:59,905 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-01-10 03:53:59,906 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 03:53:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-01-10 03:53:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 64 states have internal predecessors, (72), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 03:53:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2025-01-10 03:53:59,917 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 26 [2025-01-10 03:53:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,917 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2025-01-10 03:53:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 03:53:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2025-01-10 03:53:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 03:53:59,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 03:53:59,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash -291753928, now seen corresponding path program 1 times [2025-01-10 03:53:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960697199] [2025-01-10 03:53:59,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:59,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 03:53:59,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 03:53:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:59,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 03:53:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960697199] [2025-01-10 03:53:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960697199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:59,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:53:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499210228] [2025-01-10 03:53:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:59,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:59,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:59,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:59,964 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 03:53:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:59,977 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2025-01-10 03:53:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-10 03:53:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:59,978 INFO L225 Difference]: With dead ends: 104 [2025-01-10 03:53:59,978 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 03:53:59,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:53:59,980 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:59,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 03:53:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-10 03:53:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 62 states have internal predecessors, (68), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 03:53:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-01-10 03:53:59,987 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 31 [2025-01-10 03:53:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:59,988 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-01-10 03:53:59,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 03:53:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-01-10 03:53:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 03:53:59,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:59,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:59,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 03:53:59,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash 413607982, now seen corresponding path program 1 times [2025-01-10 03:53:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082278434] [2025-01-10 03:53:59,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:54:00,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 03:54:00,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 03:54:00,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:54:00,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:54:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 03:54:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:54:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082278434] [2025-01-10 03:54:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082278434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:54:00,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:54:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:54:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966761685] [2025-01-10 03:54:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:54:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:54:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:54:00,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:54:00,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:54:00,064 INFO L87 Difference]: Start difference. First operand 69 states and 90 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:54:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:54:00,076 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2025-01-10 03:54:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:54:00,078 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-01-10 03:54:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:54:00,078 INFO L225 Difference]: With dead ends: 79 [2025-01-10 03:54:00,078 INFO L226 Difference]: Without dead ends: 77 [2025-01-10 03:54:00,079 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-01-10 03:54:00,079 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:54:00,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 157 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:54:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-10 03:54:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-01-10 03:54:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 66 states have internal predecessors, (73), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 03:54:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2025-01-10 03:54:00,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 36 [2025-01-10 03:54:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:54:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2025-01-10 03:54:00,088 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:54:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2025-01-10 03:54:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 03:54:00,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:54:00,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:54:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 03:54:00,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:54:00,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:54:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 413667564, now seen corresponding path program 1 times [2025-01-10 03:54:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:54:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462013962] [2025-01-10 03:54:00,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:54:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:54:00,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 03:54:00,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 03:54:00,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:54:00,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:54:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 03:54:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:54:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462013962] [2025-01-10 03:54:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462013962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:54:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:54:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:54:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606295716] [2025-01-10 03:54:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:54:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:54:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:54:00,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:54:00,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:54:00,129 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:54:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:54:00,142 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2025-01-10 03:54:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:54:00,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-01-10 03:54:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:54:00,143 INFO L225 Difference]: With dead ends: 101 [2025-01-10 03:54:00,143 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 03:54:00,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:54:00,144 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:54:00,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:54:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 03:54:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 03:54:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 65 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 03:54:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-01-10 03:54:00,150 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 36 [2025-01-10 03:54:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:54:00,150 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-01-10 03:54:00,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:54:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-01-10 03:54:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 03:54:00,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:54:00,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:54:00,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 03:54:00,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:54:00,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:54:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash 516768379, now seen corresponding path program 1 times [2025-01-10 03:54:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:54:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311443157] [2025-01-10 03:54:00,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:54:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:54:00,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 03:54:00,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 03:54:00,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:54:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:54:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 03:54:00,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:54:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311443157] [2025-01-10 03:54:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311443157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:54:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:54:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:54:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382698533] [2025-01-10 03:54:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:54:00,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:54:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:54:00,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:54:00,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:54:00,190 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 03:54:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:54:00,197 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2025-01-10 03:54:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:54:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-01-10 03:54:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:54:00,198 INFO L225 Difference]: With dead ends: 95 [2025-01-10 03:54:00,198 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 03:54:00,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:54:00,199 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:54:00,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:54:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 03:54:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 03:54:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 03:54:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-01-10 03:54:00,202 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 40 [2025-01-10 03:54:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:54:00,202 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-01-10 03:54:00,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 03:54:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-01-10 03:54:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 03:54:00,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:54:00,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:54:00,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 03:54:00,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:54:00,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:54:00,206 INFO L85 PathProgramCache]: Analyzing trace with hash 177542752, now seen corresponding path program 1 times [2025-01-10 03:54:00,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:54:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315444135] [2025-01-10 03:54:00,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:54:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:54:00,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 03:54:00,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 03:54:00,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:54:00,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:54:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 03:54:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:54:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315444135] [2025-01-10 03:54:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315444135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:54:00,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:54:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:54:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858743566] [2025-01-10 03:54:00,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:54:00,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:54:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:54:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:54:00,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:54:00,236 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:54:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:54:00,246 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2025-01-10 03:54:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:54:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-01-10 03:54:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:54:00,247 INFO L225 Difference]: With dead ends: 81 [2025-01-10 03:54:00,247 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 03:54:00,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:54:00,247 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:54:00,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:54:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 03:54:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 03:54:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.196078431372549) internal successors, (61), 57 states have internal predecessors, (61), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 03:54:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-01-10 03:54:00,255 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 42 [2025-01-10 03:54:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:54:00,255 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-01-10 03:54:00,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 03:54:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-01-10 03:54:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 03:54:00,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:54:00,258 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:54:00,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 03:54:00,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:54:00,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:54:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash 782683390, now seen corresponding path program 1 times [2025-01-10 03:54:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:54:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106579684] [2025-01-10 03:54:00,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:54:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:54:00,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 03:54:00,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 03:54:00,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:54:00,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:54:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 03:54:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:54:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106579684] [2025-01-10 03:54:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106579684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:54:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:54:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:54:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984913074] [2025-01-10 03:54:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:54:00,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:54:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:54:00,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:54:00,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:54:00,297 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 03:54:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:54:00,310 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2025-01-10 03:54:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:54:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-01-10 03:54:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:54:00,311 INFO L225 Difference]: With dead ends: 70 [2025-01-10 03:54:00,311 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 03:54:00,311 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-01-10 03:54:00,312 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:54:00,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:54:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 03:54:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 03:54:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 57 states have internal predecessors, (60), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 03:54:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2025-01-10 03:54:00,317 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 48 [2025-01-10 03:54:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:54:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2025-01-10 03:54:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 03:54:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2025-01-10 03:54:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 03:54:00,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:54:00,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:54:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 03:54:00,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:54:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:54:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1504833993, now seen corresponding path program 1 times [2025-01-10 03:54:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:54:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599722050] [2025-01-10 03:54:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:54:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:54:00,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 03:54:00,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 03:54:00,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:54:00,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:54:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 03:54:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:54:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599722050] [2025-01-10 03:54:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599722050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:54:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:54:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:54:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196908088] [2025-01-10 03:54:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:54:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:54:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:54:00,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:54:00,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:54:00,346 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 03:54:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:54:00,348 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-01-10 03:54:00,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:54:00,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2025-01-10 03:54:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:54:00,349 INFO L225 Difference]: With dead ends: 68 [2025-01-10 03:54:00,349 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 03:54:00,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 03:54:00,350 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:54:00,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:54:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 03:54:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 03:54:00,351 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-01-10 03:54:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 03:54:00,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-01-10 03:54:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:54:00,351 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 03:54:00,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 03:54:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 03:54:00,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 03:54:00,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 03:54:00,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 03:54:00,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 03:54:00,356 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:54:00,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 03:54:00,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 03:54:00,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:54:00 BoogieIcfgContainer [2025-01-10 03:54:00,399 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 03:54:00,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 03:54:00,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 03:54:00,400 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 03:54:00,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:59" (3/4) ... [2025-01-10 03:54:00,402 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 03:54:00,406 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 03:54:00,406 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 03:54:00,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 03:54:00,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 03:54:00,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 03:54:00,412 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 03:54:00,413 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 03:54:00,482 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 03:54:00,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 03:54:00,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 03:54:00,483 INFO L158 Benchmark]: Toolchain (without parser) took 2690.87ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 62.4MB in the end (delta: 65.4MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2025-01-10 03:54:00,483 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:54:00,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.69ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 66.6MB in the end (delta: 61.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 03:54:00,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.21ms. Allocated memory is still 167.8MB. Free memory was 66.6MB in the beginning and 64.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:54:00,485 INFO L158 Benchmark]: Boogie Preprocessor took 25.81ms. Allocated memory is still 167.8MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:54:00,485 INFO L158 Benchmark]: RCFGBuilder took 327.46ms. Allocated memory is still 167.8MB. Free memory was 62.1MB in the beginning and 46.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 03:54:00,485 INFO L158 Benchmark]: TraceAbstraction took 1370.31ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 70.1MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:54:00,485 INFO L158 Benchmark]: Witness Printer took 82.84ms. Allocated memory is still 167.8MB. Free memory was 69.1MB in the beginning and 62.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:54:00,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.69ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 66.6MB in the end (delta: 61.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.21ms. Allocated memory is still 167.8MB. Free memory was 66.6MB in the beginning and 64.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.81ms. Allocated memory is still 167.8MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.46ms. Allocated memory is still 167.8MB. Free memory was 62.1MB in the beginning and 46.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1370.31ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 70.1MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 82.84ms. Allocated memory is still 167.8MB. Free memory was 69.1MB in the beginning and 62.4MB in the end (delta: 6.6MB). 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: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 2083 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 993 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1090 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 39, 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, 13 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 100/100 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 03:54:00,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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