./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/logname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/logname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:39:47,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:39:47,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:39:47,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:39:47,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:39:47,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:39:47,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:39:47,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:39:47,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:39:47,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:39:47,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:39:47,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:39:47,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:39:47,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:39:47,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:39:47,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:39:47,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:39:47,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:39:47,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:39:47,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:39:47,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:39:47,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:39:47,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:47,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:39:47,130 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2025-03-04 14:39:47,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:39:47,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:39:47,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:39:47,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:39:47,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:39:47,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-04 14:39:48,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34cd5bb56/d285a86ec27140e393aff1036318278d/FLAG85a88d403 [2025-03-04 14:39:48,911 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:39:48,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-04 14:39:48,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34cd5bb56/d285a86ec27140e393aff1036318278d/FLAG85a88d403 [2025-03-04 14:39:48,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34cd5bb56/d285a86ec27140e393aff1036318278d [2025-03-04 14:39:48,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:39:48,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:39:48,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:48,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:39:48,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:39:48,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:48" (1/1) ... [2025-03-04 14:39:48,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4409b757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:48, skipping insertion in model container [2025-03-04 14:39:48,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:48" (1/1) ... [2025-03-04 14:39:49,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:39:49,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:49,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:39:49,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:49,776 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:39:49,783 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:39:49,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49 WrapperNode [2025-03-04 14:39:49,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:49,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:49,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:39:49,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:39:49,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,868 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 807 [2025-03-04 14:39:49,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:49,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:39:49,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:39:49,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:39:49,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,896 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:39:49,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:39:49,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:39:49,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:39:49,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:39:49,962 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (1/1) ... [2025-03-04 14:39:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:49,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:49,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:39:49,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:39:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:39:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:39:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:39:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:39:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-04 14:39:50,012 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-04 14:39:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:39:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:39:50,251 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:39:50,253 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:39:50,756 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-03-04 14:39:50,756 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-03-04 14:39:50,812 INFO L? ?]: Removed 211 outVars from TransFormulas that were not future-live. [2025-03-04 14:39:50,813 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:39:50,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:39:50,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:39:50,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:50 BoogieIcfgContainer [2025-03-04 14:39:50,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:39:50,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:39:50,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:39:50,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:39:50,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:39:48" (1/3) ... [2025-03-04 14:39:50,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebee10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:50, skipping insertion in model container [2025-03-04 14:39:50,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:49" (2/3) ... [2025-03-04 14:39:50,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebee10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:50, skipping insertion in model container [2025-03-04 14:39:50,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:50" (3/3) ... [2025-03-04 14:39:50,838 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-03-04 14:39:50,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:39:50,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 159 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-03-04 14:39:50,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:39:50,903 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;@bc385df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:39:50,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 14:39:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 145 states have internal predecessors, (180), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:39:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:39:50,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:50,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:39:50,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:50,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 7356351, now seen corresponding path program 1 times [2025-03-04 14:39:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149244449] [2025-03-04 14:39:50,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:51,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:39:51,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:39:51,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:51,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149244449] [2025-03-04 14:39:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149244449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:51,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751567391] [2025-03-04 14:39:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:51,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:51,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:51,389 INFO L87 Difference]: Start difference. First operand has 159 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 145 states have internal predecessors, (180), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:51,434 INFO L93 Difference]: Finished difference Result 220 states and 283 transitions. [2025-03-04 14:39:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 14:39:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:51,439 INFO L225 Difference]: With dead ends: 220 [2025-03-04 14:39:51,440 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 14:39:51,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:51,443 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:51,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 14:39:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 14:39:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.488888888888889) internal successors, (67), 58 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-03-04 14:39:51,471 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 4 [2025-03-04 14:39:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:51,472 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-03-04 14:39:51,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2025-03-04 14:39:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:39:51,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:51,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:39:51,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:39:51,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:51,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash 109892460, now seen corresponding path program 1 times [2025-03-04 14:39:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087275835] [2025-03-04 14:39:51,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:51,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:51,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:51,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:51,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:51,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:51,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087275835] [2025-03-04 14:39:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087275835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:51,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580688753] [2025-03-04 14:39:51,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:51,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:51,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:39:51,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:51,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:51,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:51,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:51,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:51,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:51,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580688753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:51,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682786559] [2025-03-04 14:39:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:51,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:51,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:51,985 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:52,014 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-04 14:39:52,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:52,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 14:39:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:52,016 INFO L225 Difference]: With dead ends: 65 [2025-03-04 14:39:52,017 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 14:39:52,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:52,018 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:52,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 14:39:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 14:39:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 57 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-03-04 14:39:52,027 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 7 [2025-03-04 14:39:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:52,027 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-03-04 14:39:52,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-03-04 14:39:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:39:52,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:52,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:39:52,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:39:52,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:52,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:52,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash -888300863, now seen corresponding path program 1 times [2025-03-04 14:39:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908106998] [2025-03-04 14:39:52,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:52,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:39:52,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:39:52,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:52,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908106998] [2025-03-04 14:39:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908106998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033551996] [2025-03-04 14:39:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:52,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:52,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:52,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:52,396 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:52,413 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-04 14:39:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 14:39:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:52,415 INFO L225 Difference]: With dead ends: 64 [2025-03-04 14:39:52,415 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 14:39:52,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:52,416 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 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-03-04 14:39:52,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 14:39:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 14:39:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-03-04 14:39:52,421 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 8 [2025-03-04 14:39:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:52,421 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-04 14:39:52,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-03-04 14:39:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:39:52,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:52,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:52,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:39:52,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:52,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 384849795, now seen corresponding path program 1 times [2025-03-04 14:39:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032914957] [2025-03-04 14:39:52,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:52,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:52,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:52,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:52,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032914957] [2025-03-04 14:39:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032914957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356396454] [2025-03-04 14:39:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:52,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:52,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:39:52,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:52,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:52,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:39:52,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:52,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356396454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:39:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736108142] [2025-03-04 14:39:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:52,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:52,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:52,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:52,904 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:52,925 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-03-04 14:39:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-03-04 14:39:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:52,927 INFO L225 Difference]: With dead ends: 61 [2025-03-04 14:39:52,927 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 14:39:52,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:52,928 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:52,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 75 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 14:39:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 14:39:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-04 14:39:52,938 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 12 [2025-03-04 14:39:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:52,939 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-04 14:39:52,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-04 14:39:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:39:52,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:52,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:52,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:53,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:39:53,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:53,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash -954558076, now seen corresponding path program 1 times [2025-03-04 14:39:53,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:53,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421395322] [2025-03-04 14:39:53,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:53,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:53,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:53,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421395322] [2025-03-04 14:39:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421395322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395648934] [2025-03-04 14:39:53,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:53,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:53,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:39:53,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:53,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:53,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:53,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:53,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:53,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:53,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395648934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:53,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:53,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:39:53,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585541815] [2025-03-04 14:39:53,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:53,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:39:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:53,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:39:53,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:53,584 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:39:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:53,611 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2025-03-04 14:39:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-04 14:39:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:53,612 INFO L225 Difference]: With dead ends: 121 [2025-03-04 14:39:53,612 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 14:39:53,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:53,613 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:53,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 322 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 14:39:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 14:39:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 61 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-03-04 14:39:53,618 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 13 [2025-03-04 14:39:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:53,618 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-04 14:39:53,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:39:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-03-04 14:39:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:39:53,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:53,619 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:53,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:53,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:53,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:53,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash -103396009, now seen corresponding path program 2 times [2025-03-04 14:39:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933447770] [2025-03-04 14:39:53,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:39:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:53,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:39:53,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:39:53,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:39:53,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:39:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933447770] [2025-03-04 14:39:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933447770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:54,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:54,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:39:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687109631] [2025-03-04 14:39:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:54,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:39:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:54,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:39:54,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:54,046 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:54,090 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-03-04 14:39:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:39:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:39:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:54,091 INFO L225 Difference]: With dead ends: 68 [2025-03-04 14:39:54,091 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 14:39:54,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:54,092 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:54,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 14:39:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 14:39:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-03-04 14:39:54,098 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 22 [2025-03-04 14:39:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-03-04 14:39:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-03-04 14:39:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:39:54,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:54,099 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:54,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:39:54,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:54,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1092017333, now seen corresponding path program 1 times [2025-03-04 14:39:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435236390] [2025-03-04 14:39:54,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:54,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:39:54,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:39:54,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:39:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435236390] [2025-03-04 14:39:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435236390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:54,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:39:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144127595] [2025-03-04 14:39:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:54,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:54,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:54,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,259 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:54,277 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2025-03-04 14:39:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:54,277 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:39:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:54,278 INFO L225 Difference]: With dead ends: 115 [2025-03-04 14:39:54,278 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 14:39:54,278 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-03-04 14:39:54,279 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:54,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 14:39:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 14:39:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.290909090909091) internal successors, (71), 62 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-03-04 14:39:54,284 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 27 [2025-03-04 14:39:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:54,284 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-04 14:39:54,284 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-03-04 14:39:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:39:54,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:54,284 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] [2025-03-04 14:39:54,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:39:54,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:54,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2093822224, now seen corresponding path program 1 times [2025-03-04 14:39:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953612487] [2025-03-04 14:39:54,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:54,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:39:54,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:39:54,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:39:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953612487] [2025-03-04 14:39:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953612487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:54,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:54,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933588957] [2025-03-04 14:39:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:54,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:54,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:54,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:54,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,453 INFO L87 Difference]: Start difference. First operand 69 states and 80 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:54,478 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2025-03-04 14:39:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:54,479 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, (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 30 [2025-03-04 14:39:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:54,480 INFO L225 Difference]: With dead ends: 82 [2025-03-04 14:39:54,481 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 14:39:54,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,481 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:54,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 14:39:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-04 14:39:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.3125) internal successors, (84), 71 states have internal predecessors, (84), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-03-04 14:39:54,488 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 30 [2025-03-04 14:39:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:54,489 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-03-04 14:39:54,489 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-03-04 14:39:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:39:54,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:54,489 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:54,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:39:54,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:54,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2093822384, now seen corresponding path program 1 times [2025-03-04 14:39:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020824462] [2025-03-04 14:39:54,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:39:54,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:39:54,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:39:54,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020824462] [2025-03-04 14:39:54,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020824462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:54,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455854409] [2025-03-04 14:39:54,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:54,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:54,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:54,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:39:54,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:39:54,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:39:54,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:39:54,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:39:54,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:39:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455854409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:55,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:55,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:39:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159012217] [2025-03-04 14:39:55,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:39:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:55,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:39:55,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:39:55,072 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:39:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:55,148 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2025-03-04 14:39:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:39:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-04 14:39:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:55,149 INFO L225 Difference]: With dead ends: 158 [2025-03-04 14:39:55,149 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 14:39:55,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:39:55,150 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:55,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 338 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 14:39:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 14:39:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 88 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-03-04 14:39:55,155 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 30 [2025-03-04 14:39:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:55,155 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-03-04 14:39:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:39:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-03-04 14:39:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:39:55,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:55,156 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:55,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:39:55,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:55,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:55,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1903299149, now seen corresponding path program 1 times [2025-03-04 14:39:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817703794] [2025-03-04 14:39:55,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:39:55,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:39:55,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:39:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817703794] [2025-03-04 14:39:55,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817703794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:55,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:55,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:55,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283666871] [2025-03-04 14:39:55,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:55,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:55,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:55,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:55,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:55,528 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:55,543 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-04 14:39:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-03-04 14:39:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:55,545 INFO L225 Difference]: With dead ends: 95 [2025-03-04 14:39:55,546 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 14:39:55,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:55,547 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:55,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 14:39:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-04 14:39:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.205128205128205) internal successors, (94), 83 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-03-04 14:39:55,556 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 49 [2025-03-04 14:39:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:55,557 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-03-04 14:39:55,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-03-04 14:39:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:39:55,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:55,558 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:55,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:39:55,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:55,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 191822533, now seen corresponding path program 1 times [2025-03-04 14:39:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:55,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705543750] [2025-03-04 14:39:55,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:39:55,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:39:55,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:39:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705543750] [2025-03-04 14:39:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705543750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:55,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:55,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:55,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095006454] [2025-03-04 14:39:55,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:55,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:55,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:55,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:55,726 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-03-04 14:39:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:55,745 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-04 14:39:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 55 [2025-03-04 14:39:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:55,746 INFO L225 Difference]: With dead ends: 95 [2025-03-04 14:39:55,746 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 14:39:55,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:55,746 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:55,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 14:39:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 14:39:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 86 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2025-03-04 14:39:55,758 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 55 [2025-03-04 14:39:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:55,758 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-03-04 14:39:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-03-04 14:39:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2025-03-04 14:39:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:39:55,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:55,761 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:39:55,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 601861507, now seen corresponding path program 1 times [2025-03-04 14:39:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206584682] [2025-03-04 14:39:55,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:39:55,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:39:55,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206584682] [2025-03-04 14:39:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206584682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319925360] [2025-03-04 14:39:55,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:55,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:55,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:39:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:39:56,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:39:56,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:56,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:56,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:56,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:56,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319925360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:56,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:39:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064719268] [2025-03-04 14:39:56,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:39:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:39:56,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:56,316 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:56,341 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2025-03-04 14:39:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:56,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 55 [2025-03-04 14:39:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:56,343 INFO L225 Difference]: With dead ends: 161 [2025-03-04 14:39:56,343 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 14:39:56,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:56,343 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:56,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 14:39:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 14:39:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 104 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2025-03-04 14:39:56,352 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 55 [2025-03-04 14:39:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:56,353 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2025-03-04 14:39:56,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2025-03-04 14:39:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:39:56,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:56,354 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-04 14:39:56,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:39:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:39:56,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1772580868, now seen corresponding path program 1 times [2025-03-04 14:39:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830536423] [2025-03-04 14:39:56,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:56,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:39:56,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:39:56,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:56,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:39:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830536423] [2025-03-04 14:39:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830536423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835532575] [2025-03-04 14:39:56,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:56,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:56,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:56,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:56,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:39:57,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:39:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:39:57,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:39:57,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:39:57,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835532575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:57,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 14:39:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649973443] [2025-03-04 14:39:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:57,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:39:57,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:57,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:39:57,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:39:57,283 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:39:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:57,332 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2025-03-04 14:39:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-03-04 14:39:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:57,334 INFO L225 Difference]: With dead ends: 127 [2025-03-04 14:39:57,334 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 14:39:57,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:39:57,335 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:57,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 14:39:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 14:39:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 104 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2025-03-04 14:39:57,344 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 59 [2025-03-04 14:39:57,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:57,344 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2025-03-04 14:39:57,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:39:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2025-03-04 14:39:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:39:57,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:57,345 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:57,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:39:57,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:57,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:57,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2016260164, now seen corresponding path program 1 times [2025-03-04 14:39:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805497635] [2025-03-04 14:39:57,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:57,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:39:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:39:57,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:39:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805497635] [2025-03-04 14:39:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805497635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540182665] [2025-03-04 14:39:57,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:57,714 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:57,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:39:57,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:39:58,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:39:58,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:58,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:39:58,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540182665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75620375] [2025-03-04 14:39:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:58,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:58,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:58,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:58,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:58,039 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-03-04 14:39:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:58,057 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2025-03-04 14:39:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:58,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 58 [2025-03-04 14:39:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:58,059 INFO L225 Difference]: With dead ends: 111 [2025-03-04 14:39:58,059 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 14:39:58,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:58,060 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:58,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 14:39:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 14:39:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 103 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2025-03-04 14:39:58,066 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 58 [2025-03-04 14:39:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:58,066 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2025-03-04 14:39:58,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-03-04 14:39:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2025-03-04 14:39:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:39:58,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:58,067 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:58,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:58,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:58,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1920444487, now seen corresponding path program 1 times [2025-03-04 14:39:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959437630] [2025-03-04 14:39:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:58,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:39:58,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:39:58,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:39:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959437630] [2025-03-04 14:39:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959437630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366463292] [2025-03-04 14:39:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:58,448 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:39:58,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:39:58,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:39:58,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:58,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:39:58,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 14:39:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366463292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:58,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:39:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075265769] [2025-03-04 14:39:58,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:58,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:39:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:58,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:39:58,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:58,837 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-03-04 14:39:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:58,867 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2025-03-04 14:39:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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 59 [2025-03-04 14:39:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:58,868 INFO L225 Difference]: With dead ends: 120 [2025-03-04 14:39:58,868 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 14:39:58,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:58,869 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:58,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 14:39:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 14:39:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 112 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-03-04 14:39:58,876 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2025-03-04 14:39:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-03-04 14:39:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-03-04 14:39:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-03-04 14:39:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:39:58,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:58,877 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:58,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 14:39:59,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:39:59,078 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:39:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1445367429, now seen corresponding path program 1 times [2025-03-04 14:39:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:59,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756796570] [2025-03-04 14:39:59,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:59,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:39:59,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:39:59,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:59,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756796570] [2025-03-04 14:39:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756796570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763823429] [2025-03-04 14:39:59,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:59,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:59,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:59,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:39:59,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:39:59,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:39:59,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:59,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:59,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:39:59,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:39:59,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:59,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763823429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:59,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:59,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 14:39:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784093227] [2025-03-04 14:39:59,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:59,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:39:59,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:59,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:39:59,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:39:59,788 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:39:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:59,860 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2025-03-04 14:39:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2025-03-04 14:39:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:59,862 INFO L225 Difference]: With dead ends: 166 [2025-03-04 14:39:59,862 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 14:39:59,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:39:59,864 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:59,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 185 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 14:39:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 14:39:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 112 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:39:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2025-03-04 14:39:59,872 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 62 [2025-03-04 14:39:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:59,872 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2025-03-04 14:39:59,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:39:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2025-03-04 14:39:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:39:59,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:59,873 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:59,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:00,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 14:40:00,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:00,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash -261369165, now seen corresponding path program 2 times [2025-03-04 14:40:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300240955] [2025-03-04 14:40:00,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:00,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:40:00,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:40:00,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:40:00,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:40:00,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:00,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300240955] [2025-03-04 14:40:00,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300240955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:00,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766022363] [2025-03-04 14:40:00,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:00,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:00,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:00,285 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:00,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:40:00,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:40:00,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:40:00,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:40:00,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:00,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:00,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:40:00,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:40:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766022363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:00,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:40:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549623041] [2025-03-04 14:40:00,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:00,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:40:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:00,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:40:00,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:00,851 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:01,134 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2025-03-04 14:40:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 14:40:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 73 [2025-03-04 14:40:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:01,136 INFO L225 Difference]: With dead ends: 221 [2025-03-04 14:40:01,136 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 14:40:01,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 14:40:01,137 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:01,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 321 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 14:40:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 14:40:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 147 states have internal predecessors, (160), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2025-03-04 14:40:01,145 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 73 [2025-03-04 14:40:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:01,146 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2025-03-04 14:40:01,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2025-03-04 14:40:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 14:40:01,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:01,147 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:01,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:01,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:40:01,348 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:01,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2006007149, now seen corresponding path program 1 times [2025-03-04 14:40:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:01,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552948752] [2025-03-04 14:40:01,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:01,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 14:40:01,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 14:40:01,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:01,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:40:01,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 14:40:01,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 14:40:01,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 14:40:01,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:01,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:40:01,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 14:40:01,754 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 14:40:01,755 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (33 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 34 remaining) [2025-03-04 14:40:01,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 34 remaining) [2025-03-04 14:40:01,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 34 remaining) [2025-03-04 14:40:01,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:40:01,760 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:01,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:40:01,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:40:01 BoogieIcfgContainer [2025-03-04 14:40:01,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:40:01,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:40:01,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:40:01,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:40:01,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:50" (3/4) ... [2025-03-04 14:40:01,842 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 14:40:01,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:40:01,844 INFO L158 Benchmark]: Toolchain (without parser) took 12889.20ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 118.4MB in the beginning and 204.8MB in the end (delta: -86.4MB). Peak memory consumption was 219.7MB. Max. memory is 16.1GB. [2025-03-04 14:40:01,844 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:40:01,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 828.29ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 37.9MB in the end (delta: 80.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-04 14:40:01,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.76ms. Allocated memory is still 167.8MB. Free memory was 37.9MB in the beginning and 112.7MB in the end (delta: -74.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-03-04 14:40:01,844 INFO L158 Benchmark]: Boogie Preprocessor took 91.32ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 105.9MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:40:01,844 INFO L158 Benchmark]: IcfgBuilder took 870.63ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 108.0MB in the end (delta: -2.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 14:40:01,845 INFO L158 Benchmark]: TraceAbstraction took 11004.00ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 108.0MB in the beginning and 204.9MB in the end (delta: -96.9MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. [2025-03-04 14:40:01,845 INFO L158 Benchmark]: Witness Printer took 5.71ms. Allocated memory is still 469.8MB. Free memory was 204.9MB in the beginning and 204.8MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:40:01,846 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.31ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 828.29ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 37.9MB in the end (delta: 80.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.76ms. Allocated memory is still 167.8MB. Free memory was 37.9MB in the beginning and 112.7MB in the end (delta: -74.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.32ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 105.9MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 870.63ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 108.0MB in the end (delta: -2.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11004.00ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 108.0MB in the beginning and 204.9MB in the end (delta: -96.9MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. * Witness Printer took 5.71ms. Allocated memory is still 469.8MB. Free memory was 204.9MB in the beginning and 204.8MB in the end (delta: 40.7kB). There was no memory consumed. 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 - UnprovableResult [Line: 2339]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 2339. Possible FailurePath: [L2229] static const char *applet_name; [L2230] static signed int bb_errno_location; [L2231] static signed int * const bb_errno = &bb_errno_location; [L2232] static struct __jmp_buf_tag die_jmp[1l]; [L2233] static signed int die_sleep; [L2234] static signed char logmode = (signed char)1; [L2235] static const char *msg_eol = "\n"; [L2236] static unsigned char xfunc_error_retval = (unsigned char)1; [L2426] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2489] char *a = malloc(11); [L2490] a[10] = 0 [L2491] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=10, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND FALSE !(i<10) [L2493] applet_name = a [L2494] bb_errno_location = __VERIFIER_nondet_int() [L2495] optind = 1 [L2496] int argc = __VERIFIER_nondet_int(); [L2497] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2497] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2498] EXPR argc+1 [L2498] char **argv=malloc((argc+1)*sizeof(char*)); [L2499] EXPR argc+1 [L2499] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2500] argv[argc]=0 [L2501] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, mem_track={-14:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2501] COND TRUE i 0 && size < bufsize) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2414] RET assume_abort_if_not(size > 0 && size < bufsize) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] int i = 0; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] COND TRUE i < size [L2416] buf[i] = __VERIFIER_nondet_char() [L2415] ++i VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] COND FALSE !(i < size) [L2418] buf[size] = '\0' [L2419] return 0; VAL [\result=0, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2369] RET, EXPR getlogin_r(buf, sizeof(char [64l]) ) [L2369] return_value_getlogin_r$2=getlogin_r(buf, sizeof(char [64l]) ) [L2370] COND TRUE return_value_getlogin_r$2 == 0 [L2373] signed int return_value_fflush_all$1; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2374] CALL fflush_all() VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2338] signed int return_value_fflush$1; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2339] fflush((struct _IO_FILE *)((void *)0)) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] - UnprovableResult [Line: 2510]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2510]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2355]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2355]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2298]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2298]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 932]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 2415]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2415]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2506]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2506]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2498]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2498]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2491]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2491]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 2962 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1923 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1039 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=0, InterpolantAutomatonStates: 102, 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, 17 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1147 NumberOfCodeBlocks, 1135 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1719 SizeOfPredicates, 1 NumberOfNonLiveVariables, 11496 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 2838/3013 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 14:40:01,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/logname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:40:03,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:40:03,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-04 14:40:03,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:40:03,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:40:03,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-04 14:40:03,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:40:03,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:40:03,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:40:03,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:40:03,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:40:03,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:40:03,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:40:03,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:40:03,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:40:03,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:40:03,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:40:03,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:40:03,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:40:03,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:40:03,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:40:03,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:40:03,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:40:03,781 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 14:40:03,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 14:40:03,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:40:03,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:40:03,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:40:03,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:40:03,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2025-03-04 14:40:04,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:40:04,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:40:04,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:40:04,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:40:04,037 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:40:04,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-04 14:40:05,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a0f6afb/20202f2688364797ac2c60124ab1d5e1/FLAGd1e3a6999 [2025-03-04 14:40:05,481 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:40:05,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-04 14:40:05,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a0f6afb/20202f2688364797ac2c60124ab1d5e1/FLAGd1e3a6999 [2025-03-04 14:40:05,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a0f6afb/20202f2688364797ac2c60124ab1d5e1 [2025-03-04 14:40:05,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:40:05,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:40:05,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:40:05,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:40:05,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:40:05,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:40:05" (1/1) ... [2025-03-04 14:40:05,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7c139c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:05, skipping insertion in model container [2025-03-04 14:40:05,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:40:05" (1/1) ... [2025-03-04 14:40:05,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:40:06,113 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,114 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,116 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,116 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,120 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,121 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,121 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,122 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,123 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,125 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,125 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,128 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,132 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,141 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,153 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:40:06,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:40:06,184 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:40:06,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:40:06,430 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:40:06,437 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:40:06,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06 WrapperNode [2025-03-04 14:40:06,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:40:06,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:40:06,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:40:06,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:40:06,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,512 INFO L138 Inliner]: procedures = 605, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 781 [2025-03-04 14:40:06,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:40:06,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:40:06,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:40:06,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:40:06,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,546 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:40:06,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:40:06,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:40:06,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:40:06,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:40:06,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (1/1) ... [2025-03-04 14:40:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:40:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:06,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:40:06,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:40:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:40:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-04 14:40:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-04 14:40:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-04 14:40:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:40:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:40:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:40:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-04 14:40:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-04 14:40:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-04 14:40:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:40:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:40:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:40:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-04 14:40:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-04 14:40:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-04 14:40:06,926 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:40:06,927 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:40:07,757 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-03-04 14:40:07,757 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-03-04 14:40:07,797 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2025-03-04 14:40:07,797 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:40:07,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:40:07,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:40:07,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:40:07 BoogieIcfgContainer [2025-03-04 14:40:07,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:40:07,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:40:07,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:40:07,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:40:07,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:40:05" (1/3) ... [2025-03-04 14:40:07,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf0d1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:40:07, skipping insertion in model container [2025-03-04 14:40:07,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:40:06" (2/3) ... [2025-03-04 14:40:07,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf0d1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:40:07, skipping insertion in model container [2025-03-04 14:40:07,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:40:07" (3/3) ... [2025-03-04 14:40:07,811 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-03-04 14:40:07,820 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:40:07,822 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 156 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-03-04 14:40:07,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:40:07,875 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;@7a41adc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:40:07,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 14:40:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 142 states have internal predecessors, (175), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:40:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:40:07,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:07,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:40:07,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 7171647, now seen corresponding path program 1 times [2025-03-04 14:40:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610599780] [2025-03-04 14:40:07,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:07,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:07,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:07,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:07,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:40:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:40:08,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:40:08,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:08,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:08,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 14:40:08,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:08,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:08,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610599780] [2025-03-04 14:40:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610599780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:08,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:40:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846325138] [2025-03-04 14:40:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:08,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:40:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:08,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:40:08,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:40:08,544 INFO L87 Difference]: Start difference. First operand has 156 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 142 states have internal predecessors, (175), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:40:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:08,565 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2025-03-04 14:40:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:40:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 14:40:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:08,571 INFO L225 Difference]: With dead ends: 206 [2025-03-04 14:40:08,571 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 14:40:08,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:40:08,578 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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-03-04 14:40:08,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 14:40:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 14:40:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-04 14:40:08,607 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 4 [2025-03-04 14:40:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-04 14:40:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:40:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-04 14:40:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:40:08,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:08,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:40:08,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:40:08,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:08,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 222321224, now seen corresponding path program 1 times [2025-03-04 14:40:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627266334] [2025-03-04 14:40:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:08,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:40:08,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:40:09,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:40:09,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:09,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:09,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:40:09,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:09,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:09,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627266334] [2025-03-04 14:40:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627266334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:09,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595572267] [2025-03-04 14:40:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:09,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:09,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:09,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:09,421 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:40:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:09,449 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-03-04 14:40:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-04 14:40:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:09,450 INFO L225 Difference]: With dead ends: 110 [2025-03-04 14:40:09,450 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 14:40:09,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:09,451 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-03-04 14:40:09,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 14:40:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 14:40:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-04 14:40:09,456 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 5 [2025-03-04 14:40:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:09,456 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-04 14:40:09,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:40:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-04 14:40:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:40:09,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:09,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:40:09,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 14:40:09,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:09,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 332183489, now seen corresponding path program 1 times [2025-03-04 14:40:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897291429] [2025-03-04 14:40:09,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:09,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:09,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:40:09,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:40:10,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:40:10,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:10,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:10,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:10,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:10,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:10,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:10,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897291429] [2025-03-04 14:40:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897291429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:10,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:40:10,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:40:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997622971] [2025-03-04 14:40:10,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:10,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:10,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:10,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:10,387 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:40:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:10,457 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2025-03-04 14:40:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 8 [2025-03-04 14:40:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:10,461 INFO L225 Difference]: With dead ends: 113 [2025-03-04 14:40:10,461 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 14:40:10,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:10,461 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:10,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 14:40:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-03-04 14:40:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.326086956521739) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-04 14:40:10,466 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 8 [2025-03-04 14:40:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-04 14:40:10,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:40:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-04 14:40:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 14:40:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:10,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:10,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:10,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:10,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1574277481, now seen corresponding path program 1 times [2025-03-04 14:40:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:10,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205587408] [2025-03-04 14:40:10,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:10,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:10,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:40:10,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 14:40:11,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 14:40:11,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:11,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:40:11,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:40:11,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:11,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205587408] [2025-03-04 14:40:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205587408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584334674] [2025-03-04 14:40:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:11,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:11,301 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:11,486 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-03-04 14:40:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 14:40:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:11,487 INFO L225 Difference]: With dead ends: 59 [2025-03-04 14:40:11,487 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 14:40:11,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:11,488 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:11,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 161 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 14:40:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 14:40:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-03-04 14:40:11,492 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 16 [2025-03-04 14:40:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:11,492 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-03-04 14:40:11,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-03-04 14:40:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:40:11,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:11,493 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:11,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:40:11,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:11,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:11,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash 475218687, now seen corresponding path program 1 times [2025-03-04 14:40:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324166918] [2025-03-04 14:40:11,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:11,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:11,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:11,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:40:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:40:12,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:40:12,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:12,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:40:12,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:40:12,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:12,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324166918] [2025-03-04 14:40:12,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324166918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:12,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198831824] [2025-03-04 14:40:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:12,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:12,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:12,346 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-03-04 14:40:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:12,478 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2025-03-04 14:40:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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 22 [2025-03-04 14:40:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:12,480 INFO L225 Difference]: With dead ends: 65 [2025-03-04 14:40:12,480 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 14:40:12,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:12,481 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:12,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 115 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 14:40:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-04 14:40:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 56 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-03-04 14:40:12,485 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 22 [2025-03-04 14:40:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-03-04 14:40:12,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-03-04 14:40:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-03-04 14:40:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:40:12,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:12,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:12,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:12,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:12,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 475223652, now seen corresponding path program 1 times [2025-03-04 14:40:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875217703] [2025-03-04 14:40:12,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:12,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:12,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:40:12,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:40:13,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:40:13,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:13,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:13,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:40:13,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:40:13,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:13,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875217703] [2025-03-04 14:40:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875217703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:13,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:13,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907784955] [2025-03-04 14:40:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:13,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:13,351 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-03-04 14:40:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:13,384 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2025-03-04 14:40:13,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:13,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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 22 [2025-03-04 14:40:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:13,386 INFO L225 Difference]: With dead ends: 114 [2025-03-04 14:40:13,386 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 14:40:13,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:13,386 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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-03-04 14:40:13,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 14:40:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 14:40:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 62 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-03-04 14:40:13,391 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 22 [2025-03-04 14:40:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:13,391 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-03-04 14:40:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-03-04 14:40:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2025-03-04 14:40:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:40:13,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:13,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:13,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:40:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:13,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1175762965, now seen corresponding path program 1 times [2025-03-04 14:40:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142462357] [2025-03-04 14:40:13,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:13,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:13,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:13,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:13,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:40:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:40:14,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:40:14,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:14,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:14,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:14,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:40:14,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:40:14,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142462357] [2025-03-04 14:40:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142462357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:14,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:40:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:40:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130540991] [2025-03-04 14:40:14,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:14,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:14,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:14,368 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:14,474 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2025-03-04 14:40:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-03-04 14:40:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:14,476 INFO L225 Difference]: With dead ends: 124 [2025-03-04 14:40:14,476 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 14:40:14,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:14,478 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:14,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 14:40:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-04 14:40:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-04 14:40:14,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 25 [2025-03-04 14:40:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-04 14:40:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2025-03-04 14:40:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 14:40:14,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:14,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:14,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:14,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:14,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:14,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 698209346, now seen corresponding path program 1 times [2025-03-04 14:40:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964871621] [2025-03-04 14:40:14,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:14,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:14,694 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:14,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:40:14,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 14:40:15,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 14:40:15,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:15,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:15,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:40:15,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 14:40:15,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:15,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964871621] [2025-03-04 14:40:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964871621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:15,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347716333] [2025-03-04 14:40:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:15,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:15,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:15,311 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-03-04 14:40:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:15,342 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-03-04 14:40:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:15,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 32 [2025-03-04 14:40:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:15,343 INFO L225 Difference]: With dead ends: 74 [2025-03-04 14:40:15,343 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 14:40:15,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:15,343 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:15,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 14:40:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 14:40:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 66 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-03-04 14:40:15,350 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 32 [2025-03-04 14:40:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:15,350 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-03-04 14:40:15,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-03-04 14:40:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-03-04 14:40:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 14:40:15,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:15,353 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:15,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:15,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:15,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:15,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash -319722982, now seen corresponding path program 1 times [2025-03-04 14:40:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104102661] [2025-03-04 14:40:15,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:15,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:15,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:15,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:15,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:40:15,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 14:40:16,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 14:40:16,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:16,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:16,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:40:16,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:40:16,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:16,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104102661] [2025-03-04 14:40:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104102661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:16,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:40:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775321396] [2025-03-04 14:40:16,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:16,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:16,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:16,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:16,274 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:16,643 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2025-03-04 14:40:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:16,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-04 14:40:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:16,645 INFO L225 Difference]: With dead ends: 111 [2025-03-04 14:40:16,645 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 14:40:16,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:16,647 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:16,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 182 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:40:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 14:40:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 14:40:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-03-04 14:40:16,655 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 35 [2025-03-04 14:40:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-03-04 14:40:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-03-04 14:40:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:40:16,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:16,659 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:16,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:40:16,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:16,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:16,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1160918455, now seen corresponding path program 1 times [2025-03-04 14:40:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:16,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315707553] [2025-03-04 14:40:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:16,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:16,862 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:16,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:40:17,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:40:17,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:40:17,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:17,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:17,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:17,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:40:17,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:40:17,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:17,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315707553] [2025-03-04 14:40:17,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315707553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:17,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:40:17,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:40:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818845319] [2025-03-04 14:40:17,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:17,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:17,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:17,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:17,686 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:17,967 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2025-03-04 14:40:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:17,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 38 [2025-03-04 14:40:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:17,970 INFO L225 Difference]: With dead ends: 94 [2025-03-04 14:40:17,970 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 14:40:17,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:17,971 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:17,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 14:40:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2025-03-04 14:40:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 56 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-04 14:40:17,981 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 38 [2025-03-04 14:40:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:17,981 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-04 14:40:17,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-04 14:40:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 14:40:17,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:17,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:18,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 14:40:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:18,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1047214786, now seen corresponding path program 1 times [2025-03-04 14:40:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865119156] [2025-03-04 14:40:18,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:18,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:18,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:18,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:40:18,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 14:40:18,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 14:40:18,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:18,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:18,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:40:18,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 14:40:18,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:18,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865119156] [2025-03-04 14:40:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865119156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:18,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:40:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843755721] [2025-03-04 14:40:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:18,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:18,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:18,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:18,945 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:19,025 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2025-03-04 14:40:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 14:40:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:19,027 INFO L225 Difference]: With dead ends: 79 [2025-03-04 14:40:19,027 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 14:40:19,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:19,027 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:19,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 14:40:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 14:40:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 56 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-03-04 14:40:19,031 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 45 [2025-03-04 14:40:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:19,032 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-03-04 14:40:19,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-03-04 14:40:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 14:40:19,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:19,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:19,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 14:40:19,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:19,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:19,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1195077957, now seen corresponding path program 1 times [2025-03-04 14:40:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174445488] [2025-03-04 14:40:19,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:19,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:19,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:19,236 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:19,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:40:19,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 14:40:19,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 14:40:19,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:19,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:19,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:19,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:40:19,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:40:20,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:20,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174445488] [2025-03-04 14:40:20,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174445488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:20,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:40:20,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:40:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742145905] [2025-03-04 14:40:20,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:20,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:20,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:20,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:20,009 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-03-04 14:40:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:20,094 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-04 14:40:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 45 [2025-03-04 14:40:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:20,096 INFO L225 Difference]: With dead ends: 70 [2025-03-04 14:40:20,096 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 14:40:20,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:20,097 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:20,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 14:40:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2025-03-04 14:40:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-03-04 14:40:20,101 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 45 [2025-03-04 14:40:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:20,101 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-03-04 14:40:20,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-03-04 14:40:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-03-04 14:40:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:40:20,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:20,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:20,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 14:40:20,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:20,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:20,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1757937601, now seen corresponding path program 1 times [2025-03-04 14:40:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:20,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666624270] [2025-03-04 14:40:20,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:20,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:20,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:20,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:20,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 14:40:20,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:40:20,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:40:20,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:20,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:21,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:21,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 14:40:21,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:21,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:21,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666624270] [2025-03-04 14:40:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666624270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:21,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:40:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390413475] [2025-03-04 14:40:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:21,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:21,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:21,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:21,068 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:40:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:21,133 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-04 14:40:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:40:21,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-04 14:40:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:21,134 INFO L225 Difference]: With dead ends: 66 [2025-03-04 14:40:21,134 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 14:40:21,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:21,135 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:21,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 14:40:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 14:40:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 55 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-03-04 14:40:21,139 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 49 [2025-03-04 14:40:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:21,139 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-03-04 14:40:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 14:40:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-03-04 14:40:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 14:40:21,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:21,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:21,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 14:40:21,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:21,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:21,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1435765303, now seen corresponding path program 1 times [2025-03-04 14:40:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837448210] [2025-03-04 14:40:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:21,344 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:21,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 14:40:21,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 14:40:22,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 14:40:22,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:22,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:22,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:40:22,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:40:22,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:40:22,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:22,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837448210] [2025-03-04 14:40:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837448210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:22,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:40:22,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:40:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509078515] [2025-03-04 14:40:22,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:22,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:40:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:22,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:40:22,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:40:22,269 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:40:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:22,387 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-03-04 14:40:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:40:22,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-03-04 14:40:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:22,389 INFO L225 Difference]: With dead ends: 127 [2025-03-04 14:40:22,389 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 14:40:22,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:40:22,390 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:22,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 14:40:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 14:40:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-04 14:40:22,398 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 48 [2025-03-04 14:40:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:22,398 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-04 14:40:22,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:40:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-04 14:40:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:40:22,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:22,401 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:22,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 14:40:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:22,602 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:22,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash 620599159, now seen corresponding path program 2 times [2025-03-04 14:40:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:22,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271664153] [2025-03-04 14:40:22,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:22,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:22,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:22,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:22,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 14:40:22,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 14:40:25,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:40:25,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:40:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:25,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:40:25,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 14:40:25,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 14:40:25,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:40:25,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271664153] [2025-03-04 14:40:25,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271664153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:25,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:40:25,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:40:25,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572967376] [2025-03-04 14:40:25,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:25,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:40:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:40:25,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:40:25,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:40:25,558 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:25,743 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2025-03-04 14:40:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:40:25,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-03-04 14:40:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:25,745 INFO L225 Difference]: With dead ends: 133 [2025-03-04 14:40:25,745 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 14:40:25,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:40:25,746 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:25,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 14:40:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 14:40:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 79 states have internal predecessors, (88), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 14:40:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-03-04 14:40:25,752 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 60 [2025-03-04 14:40:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:25,753 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-03-04 14:40:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-03-04 14:40:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 14:40:25,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:25,753 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:25,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 14:40:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:25,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 14:40:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1826270263, now seen corresponding path program 3 times [2025-03-04 14:40:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:40:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809941996] [2025-03-04 14:40:25,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:40:25,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:25,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:25,957 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:25,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 14:40:26,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 9 equivalence classes.