./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-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/whoami-incomplete-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 b2d3240eb68fa1b9c7110ab5a4d2b15ab10d80ad2f92d88b4fa8dd13db15a180 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:44:34,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:44:34,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:44:34,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:44:34,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:44:34,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:44:34,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:44:34,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:44:34,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:44:34,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:44:34,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:44:34,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:44:34,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:44:34,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:44:34,626 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:44:34,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:44:34,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:44:34,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:44:34,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:44:34,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:44:34,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:44:34,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:44:34,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:44:34,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:44:34,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:44:34,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:44:34,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:44:34,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:44:34,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:44:34,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:44:34,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:44:34,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:44:34,629 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 -> b2d3240eb68fa1b9c7110ab5a4d2b15ab10d80ad2f92d88b4fa8dd13db15a180 [2025-03-04 14:44:34,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:44:34,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:44:34,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:44:34,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:44:34,844 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:44:34,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-1.i [2025-03-04 14:44:35,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0277484/371fd95bb1de4ec0b3682471255f04c7/FLAG930eb0bb3 [2025-03-04 14:44:36,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:44:36,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-1.i [2025-03-04 14:44:36,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0277484/371fd95bb1de4ec0b3682471255f04c7/FLAG930eb0bb3 [2025-03-04 14:44:36,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0277484/371fd95bb1de4ec0b3682471255f04c7 [2025-03-04 14:44:36,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:44:36,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:44:36,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:44:36,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:44:36,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:44:36,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:44:36" (1/1) ... [2025-03-04 14:44:36,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec0188c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:36, skipping insertion in model container [2025-03-04 14:44:36,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:44:36" (1/1) ... [2025-03-04 14:44:36,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:44:37,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:44:37,093 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:44:37,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:44:37,307 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:44:37,313 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:44:37,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37 WrapperNode [2025-03-04 14:44:37,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:44:37,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:44:37,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:44:37,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:44:37,318 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:44:37" (1/1) ... [2025-03-04 14:44:37,342 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:44:37" (1/1) ... [2025-03-04 14:44:37,382 INFO L138 Inliner]: procedures = 613, calls = 509, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 817 [2025-03-04 14:44:37,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:44:37,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:44:37,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:44:37,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:44:37,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,411 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:44:37,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:44:37,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:44:37,462 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:44:37,462 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:44:37,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (1/1) ... [2025-03-04 14:44:37,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:44:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:37,494 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:44:37,497 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:44:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:44:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:44:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:44:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:44:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-04 14:44:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:44:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:44:37,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:44:37,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:44:38,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: havoc bb_internal_getpwuid_#t~ret120#1.base, bb_internal_getpwuid_#t~ret120#1.offset; [2025-03-04 14:44:38,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: havoc xuid2uname_#t~mem116#1.base, xuid2uname_#t~mem116#1.offset; [2025-03-04 14:44:38,350 INFO L? ?]: Removed 245 outVars from TransFormulas that were not future-live. [2025-03-04 14:44:38,350 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:44:38,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:44:38,368 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:44:38,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:38 BoogieIcfgContainer [2025-03-04 14:44:38,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:44:38,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:44:38,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:44:38,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:44:38,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:44:36" (1/3) ... [2025-03-04 14:44:38,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b16a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:44:38, skipping insertion in model container [2025-03-04 14:44:38,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:37" (2/3) ... [2025-03-04 14:44:38,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b16a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:44:38, skipping insertion in model container [2025-03-04 14:44:38,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:38" (3/3) ... [2025-03-04 14:44:38,376 INFO L128 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-1.i [2025-03-04 14:44:38,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:44:38,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG whoami-incomplete-1.i that has 4 procedures, 162 locations, 1 initial locations, 11 loop locations, and 40 error locations. [2025-03-04 14:44:38,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:44:38,439 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;@5cbd73c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:44:38,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 14:44:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 111 states have (on average 1.6486486486486487) internal successors, (183), 151 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 14:44:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:44:38,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:38,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:44:38,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:38,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash 7510271, now seen corresponding path program 1 times [2025-03-04 14:44:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481952732] [2025-03-04 14:44:38,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:38,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:44:38,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:44:38,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:38,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:38,914 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:44:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:38,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481952732] [2025-03-04 14:44:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481952732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663566897] [2025-03-04 14:44:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:38,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:38,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:38,934 INFO L87 Difference]: Start difference. First operand has 162 states, 111 states have (on average 1.6486486486486487) internal successors, (183), 151 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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:44:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:38,973 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2025-03-04 14:44:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:38,975 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:44:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:38,979 INFO L225 Difference]: With dead ends: 210 [2025-03-04 14:44:38,980 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 14:44:38,983 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:44:38,986 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 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:44:38,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 14:44:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 14:44:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 48 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-04 14:44:39,019 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 4 [2025-03-04 14:44:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:39,019 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-04 14:44:39,019 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:44:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-04 14:44:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:44:39,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:39,019 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:44:39,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:44:39,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 400360849, now seen corresponding path program 1 times [2025-03-04 14:44:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312104888] [2025-03-04 14:44:39,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:39,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:44:39,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:44:39,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:39,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:39,232 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:44:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312104888] [2025-03-04 14:44:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312104888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:39,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426512926] [2025-03-04 14:44:39,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:39,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:39,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:39,236 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:44:39,238 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:44:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:44:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:44:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:39,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:39,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:39,546 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:44:39,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426512926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:44:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3391444] [2025-03-04 14:44:39,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:39,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:39,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:39,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:39,549 INFO L87 Difference]: Start difference. First operand 52 states and 57 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:44:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:39,570 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-04 14:44:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:44:39,571 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:44:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:39,572 INFO L225 Difference]: With dead ends: 52 [2025-03-04 14:44:39,572 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 14:44:39,572 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:44:39,573 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 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:44:39,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 14:44:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-04 14:44:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-04 14:44:39,580 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 7 [2025-03-04 14:44:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:39,581 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-04 14:44:39,581 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:44:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-04 14:44:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:44:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:39,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:44:39,590 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:44:39,782 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:44:39,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -473715391, now seen corresponding path program 1 times [2025-03-04 14:44:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738977221] [2025-03-04 14:44:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:39,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:44:39,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:44:39,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:39,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:39,937 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:44:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738977221] [2025-03-04 14:44:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738977221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:39,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:39,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099981384] [2025-03-04 14:44:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:39,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:39,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:39,938 INFO L87 Difference]: Start difference. First operand 51 states and 56 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:44:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:39,952 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-04 14:44:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:39,952 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:44:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:39,953 INFO L225 Difference]: With dead ends: 51 [2025-03-04 14:44:39,953 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 14:44:39,953 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:44:39,954 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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:44:39,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 14:44:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-04 14:44:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-04 14:44:39,957 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 8 [2025-03-04 14:44:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:39,957 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-04 14:44:39,957 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:44:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-04 14:44:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:44:39,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:39,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:44:39,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:39,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash -556425046, now seen corresponding path program 1 times [2025-03-04 14:44:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:39,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331093531] [2025-03-04 14:44:39,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:44:40,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:44:40,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:40,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:40,113 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:44:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331093531] [2025-03-04 14:44:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331093531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238197233] [2025-03-04 14:44:40,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:40,115 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:44:40,117 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:44:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:44:40,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:44:40,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:40,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:40,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:44:40,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:40,379 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:44:40,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238197233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:40,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:40,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:44:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311089849] [2025-03-04 14:44:40,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:40,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:40,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:40,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:40,381 INFO L87 Difference]: Start difference. First operand 48 states and 53 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:44:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:40,408 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-04 14:44:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:40,411 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:44:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:40,411 INFO L225 Difference]: With dead ends: 48 [2025-03-04 14:44:40,411 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 14:44:40,412 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:44:40,412 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 53 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:44:40,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 14:44:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 14:44:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-04 14:44:40,417 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 12 [2025-03-04 14:44:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:40,417 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-04 14:44:40,417 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:44:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-04 14:44:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:44:40,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:40,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:40,427 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:44:40,619 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:44:40,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash -69307070, now seen corresponding path program 1 times [2025-03-04 14:44:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690900100] [2025-03-04 14:44:40,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:40,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:44:40,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:44:40,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:40,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:40,807 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:44:40,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:40,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690900100] [2025-03-04 14:44:40,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690900100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:40,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089305372] [2025-03-04 14:44:40,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:40,813 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:44:40,816 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:44:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:44:41,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:44:41,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:41,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:41,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:41,073 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:44:41,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:41,099 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:44:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089305372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:41,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:41,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:44:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188937446] [2025-03-04 14:44:41,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:41,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:44:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:41,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:44:41,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:41,101 INFO L87 Difference]: Start difference. First operand 46 states and 51 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:44:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:41,124 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2025-03-04 14:44:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:41,124 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:44:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:41,125 INFO L225 Difference]: With dead ends: 95 [2025-03-04 14:44:41,125 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 14:44:41,125 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:44:41,126 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:41,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 14:44:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 14:44:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-03-04 14:44:41,133 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2025-03-04 14:44:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:41,133 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-03-04 14:44:41,133 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:44:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-03-04 14:44:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:44:41,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:41,134 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:41,142 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:44:41,334 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:44:41,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1789736016, now seen corresponding path program 2 times [2025-03-04 14:44:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617170381] [2025-03-04 14:44:41,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:41,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:44:41,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:44:41,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:44:41,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:41,608 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:44:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617170381] [2025-03-04 14:44:41,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617170381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280901211] [2025-03-04 14:44:41,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:44:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:41,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:44:41,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:41,610 INFO L87 Difference]: Start difference. First operand 55 states and 60 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:44:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:41,643 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-03-04 14:44:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:44:41,645 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:44:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:41,645 INFO L225 Difference]: With dead ends: 55 [2025-03-04 14:44:41,645 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 14:44:41,646 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:44:41,646 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:41,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 125 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 14:44:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 14:44:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.25) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-04 14:44:41,651 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 22 [2025-03-04 14:44:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-04 14:44:41,652 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:44:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-04 14:44:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:44:41,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:41,652 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:44:41,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:44:41,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1951169545, now seen corresponding path program 1 times [2025-03-04 14:44:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463832484] [2025-03-04 14:44:41,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:41,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:44:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:44:41,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:41,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:41,828 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:44:41,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:41,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463832484] [2025-03-04 14:44:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463832484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:41,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49973105] [2025-03-04 14:44:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:41,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:41,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:41,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:41,829 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:41,846 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-03-04 14:44:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:44:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:41,847 INFO L225 Difference]: With dead ends: 85 [2025-03-04 14:44:41,849 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 14:44:41,849 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:44:41,849 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 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:44:41,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 14:44:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 14:44:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-04 14:44:41,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 27 [2025-03-04 14:44:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-04 14:44:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-04 14:44:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:44:41,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:41,860 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:44:41,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:44:41,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 795629961, now seen corresponding path program 1 times [2025-03-04 14:44:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032913469] [2025-03-04 14:44:41,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:44:41,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:44:41,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:42,080 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:44:42,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:42,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032913469] [2025-03-04 14:44:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032913469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329861273] [2025-03-04 14:44:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:42,083 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:44:42,084 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:44:42,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:44:42,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:44:42,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:42,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:42,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:42,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:42,410 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:44:42,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:42,478 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:44:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329861273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:42,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:42,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:44:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536112378] [2025-03-04 14:44:42,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:42,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:44:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:42,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:44:42,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:44:42,480 INFO L87 Difference]: Start difference. First operand 56 states and 61 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:44:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:42,564 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2025-03-04 14:44:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:44:42,564 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:44:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:42,565 INFO L225 Difference]: With dead ends: 114 [2025-03-04 14:44:42,565 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 14:44:42,566 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:44:42,566 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:42,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 261 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 14:44:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 14:44:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-04 14:44:42,571 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 30 [2025-03-04 14:44:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:42,571 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-04 14:44:42,571 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:44:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-04 14:44:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 14:44:42,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:42,572 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:42,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:42,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:42,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1913124137, now seen corresponding path program 1 times [2025-03-04 14:44:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405202620] [2025-03-04 14:44:42,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:42,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 14:44:42,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 14:44:42,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:42,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:44:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405202620] [2025-03-04 14:44:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405202620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:42,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:42,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546285912] [2025-03-04 14:44:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:42,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:42,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:42,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:42,966 INFO L87 Difference]: Start difference. First operand 73 states and 78 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:44:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:42,987 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-03-04 14:44:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:42,987 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 48 [2025-03-04 14:44:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:42,988 INFO L225 Difference]: With dead ends: 85 [2025-03-04 14:44:42,988 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 14:44:42,988 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:44:42,988 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 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:44:42,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 14:44:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-04 14:44:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-04 14:44:42,994 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 48 [2025-03-04 14:44:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:42,994 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-04 14:44:42,994 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:44:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-04 14:44:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:44:42,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:42,997 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:44:42,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:44:42,997 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:42,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -822688775, now seen corresponding path program 1 times [2025-03-04 14:44:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:42,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966177083] [2025-03-04 14:44:42,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:44:43,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:44:43,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:43,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:43,170 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:44:43,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:43,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966177083] [2025-03-04 14:44:43,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966177083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421638521] [2025-03-04 14:44:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:43,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:43,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:43,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:43,172 INFO L87 Difference]: Start difference. First operand 82 states and 90 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:44:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:43,182 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-03-04 14:44:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:43,183 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:44:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:43,183 INFO L225 Difference]: With dead ends: 82 [2025-03-04 14:44:43,184 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 14:44:43,184 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:44:43,184 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 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:44:43,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 14:44:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-04 14:44:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-04 14:44:43,191 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 49 [2025-03-04 14:44:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-04 14:44:43,192 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:44:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-04 14:44:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 14:44:43,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:43,194 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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:44:43,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:44:43,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:43,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1852844674, now seen corresponding path program 1 times [2025-03-04 14:44:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92610308] [2025-03-04 14:44:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:43,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 14:44:43,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 14:44:43,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:43,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92610308] [2025-03-04 14:44:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92610308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:44:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276937595] [2025-03-04 14:44:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:43,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:43,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:43,441 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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:44:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:43,446 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2025-03-04 14:44:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:43,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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 53 [2025-03-04 14:44:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:43,447 INFO L225 Difference]: With dead ends: 80 [2025-03-04 14:44:43,447 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 14:44:43,447 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:44:43,448 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:43,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 14:44:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 14:44:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-03-04 14:44:43,454 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 53 [2025-03-04 14:44:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-03-04 14:44:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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:44:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-03-04 14:44:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 14:44:43,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:43,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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:44:43,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:44:43,455 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:43,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1852843713, now seen corresponding path program 1 times [2025-03-04 14:44:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:43,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463122431] [2025-03-04 14:44:43,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:43,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:43,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 14:44:43,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 14:44:43,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:43,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:43,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463122431] [2025-03-04 14:44:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463122431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:44:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386750476] [2025-03-04 14:44:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:44:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:43,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:44:43,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:43,872 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:43,920 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-03-04 14:44:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 14:44:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:43,921 INFO L225 Difference]: With dead ends: 96 [2025-03-04 14:44:43,922 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 14:44:43,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:44:43,922 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 40 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:43,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 127 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 14:44:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 14:44:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-03-04 14:44:43,927 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 53 [2025-03-04 14:44:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:43,927 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-03-04 14:44:43,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-03-04 14:44:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:44:43,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:43,928 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:44:43,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:44:43,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:43,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1119256591, now seen corresponding path program 1 times [2025-03-04 14:44:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887296103] [2025-03-04 14:44:43,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:43,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:44:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:44:44,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:44,126 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:44:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887296103] [2025-03-04 14:44:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887296103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144676213] [2025-03-04 14:44:44,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:44,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:44,129 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:44:44,131 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:44:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:44:44,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:44:44,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:44,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:44,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:44,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:44,505 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:44:44,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:44,523 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:44:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144676213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:44,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:44:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659986084] [2025-03-04 14:44:44,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:44,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:44:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:44,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:44:44,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:44,524 INFO L87 Difference]: Start difference. First operand 77 states and 82 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:44:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:44,551 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2025-03-04 14:44:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:44,551 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:44:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:44,552 INFO L225 Difference]: With dead ends: 125 [2025-03-04 14:44:44,552 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 14:44:44,552 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:44:44,552 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:44,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 14:44:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 14:44:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2025-03-04 14:44:44,561 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 55 [2025-03-04 14:44:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:44,561 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2025-03-04 14:44:44,561 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:44:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2025-03-04 14:44:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 14:44:44,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:44,564 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:44,573 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:44:44,764 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,SelfDestructingSolverStorable12 [2025-03-04 14:44:44,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:44,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2073731207, now seen corresponding path program 1 times [2025-03-04 14:44:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763746451] [2025-03-04 14:44:44,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:44,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 14:44:44,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 14:44:44,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:44,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:45,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:45,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763746451] [2025-03-04 14:44:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763746451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:45,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396804850] [2025-03-04 14:44:45,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:45,095 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:44:45,097 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:44:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 14:44:45,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 14:44:45,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:45,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:45,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:45,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:45,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:45,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396804850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:45,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:45,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 14:44:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673044391] [2025-03-04 14:44:45,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:45,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:44:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:45,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:44:45,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:45,600 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 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:44:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:45,661 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2025-03-04 14:44:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:44:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 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 69 [2025-03-04 14:44:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:45,662 INFO L225 Difference]: With dead ends: 170 [2025-03-04 14:44:45,663 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 14:44:45,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:45,663 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:45,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 14:44:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-04 14:44:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 124 states have (on average 1.0725806451612903) internal successors, (133), 127 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2025-03-04 14:44:45,680 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 69 [2025-03-04 14:44:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:45,680 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2025-03-04 14:44:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 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:44:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2025-03-04 14:44:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 14:44:45,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:45,682 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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:44:45,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:45,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:45,883 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash -146342713, now seen corresponding path program 2 times [2025-03-04 14:44:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302080601] [2025-03-04 14:44:45,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:45,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 14:44:46,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 14:44:46,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:44:46,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:44:46,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 14:44:46,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 14:44:46,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 14:44:46,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:46,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:44:46,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 14:44:46,515 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 14:44:46,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE (39 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (38 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2025-03-04 14:44:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2025-03-04 14:44:46,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2025-03-04 14:44:46,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2025-03-04 14:44:46,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2025-03-04 14:44:46,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 40 remaining) [2025-03-04 14:44:46,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2025-03-04 14:44:46,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2025-03-04 14:44:46,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2025-03-04 14:44:46,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2025-03-04 14:44:46,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:44:46,523 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:46,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:44:46,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:44:46 BoogieIcfgContainer [2025-03-04 14:44:46,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:44:46,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:44:46,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:44:46,609 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:44:46,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:38" (3/4) ... [2025-03-04 14:44:46,611 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 14:44:46,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:44:46,612 INFO L158 Benchmark]: Toolchain (without parser) took 10173.70ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 108.1MB in the beginning and 148.3MB in the end (delta: -40.2MB). Peak memory consumption was 197.4MB. Max. memory is 16.1GB. [2025-03-04 14:44:46,612 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:44:46,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 874.43ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 89.4MB in the end (delta: 18.7MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2025-03-04 14:44:46,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.43ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 81.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:44:46,613 INFO L158 Benchmark]: Boogie Preprocessor took 77.99ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 74.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:44:46,613 INFO L158 Benchmark]: IcfgBuilder took 907.56ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 54.1MB in the end (delta: 20.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-03-04 14:44:46,613 INFO L158 Benchmark]: TraceAbstraction took 8237.79ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 53.2MB in the beginning and 148.3MB in the end (delta: -95.1MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. [2025-03-04 14:44:46,614 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 377.5MB. Free memory was 148.3MB in the beginning and 148.3MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:44:46,616 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.15ms. Allocated memory is still 226.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 874.43ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 89.4MB in the end (delta: 18.7MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.43ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 81.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.99ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 74.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 907.56ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 54.1MB in the end (delta: 20.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8237.79ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 53.2MB in the beginning and 148.3MB in the end (delta: -95.1MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 377.5MB. Free memory was 148.3MB in the beginning and 148.3MB in the end (delta: 31.8kB). 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: 972]: 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 undefined function vasprintf at line 972. Possible FailurePath: [L2271] static const char *applet_name; [L2272] static signed int bb_errno_location; [L2273] static signed int * const bb_errno = &bb_errno_location; [L2274] static struct __jmp_buf_tag die_jmp[1l]; [L2275] static signed int die_sleep; [L2276] static signed char logmode = (signed char)1; [L2277] static const char *msg_eol = "\n"; [L2278] static unsigned char xfunc_error_retval = (unsigned char)1; [L2451] static struct passwd p; [L2473] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2536] char *a = malloc(11); [L2537] a[10] = 0 [L2538] int i=0; VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=0, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=0, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=1, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=1, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=2, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=2, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=3, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=3, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=4, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=4, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=5, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=5, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=6, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=6, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=7, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=7, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=8, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=8, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=9, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND TRUE i<10 [L2539] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=9, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=10, logmode=1, msg_eol={3:0}, p={13:0}, xfunc_error_retval=1] [L2538] COND FALSE !(i<10) [L2540] applet_name = a [L2541] bb_errno_location = __VERIFIER_nondet_int() [L2542] optind = 1 [L2543] int argc = __VERIFIER_nondet_int(); [L2544] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={331:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, logmode=1, msg_eol={3:0}, optind=1, p={13:0}, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={331:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, logmode=1, msg_eol={3:0}, optind=1, p={13:0}, xfunc_error_retval=1] [L2544] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={331:0}, argc=1, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, logmode=1, msg_eol={3:0}, optind=1, p={13:0}, xfunc_error_retval=1] [L2545] EXPR argc+1 [L2545] char **argv=malloc((argc+1)*sizeof(char*)); [L2546] EXPR argc+1 [L2546] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2547] argv[argc]=0 [L2548] int i=0; VAL [applet_name={331:0}, argc=1, argv={-12:0}, bb_errno={12:0}, bb_errno_location={12:0}, die_sleep=0, dummy_utmp={14:0}, i=0, logmode=1, mem_track={-13:0}, msg_eol={3:0}, optind=1, p={13:0}, xfunc_error_retval=1] [L2548] COND TRUE i 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 -> b2d3240eb68fa1b9c7110ab5a4d2b15ab10d80ad2f92d88b4fa8dd13db15a180 [2025-03-04 14:44:48,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:44:48,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:44:48,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:44:48,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:44:48,920 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:44:48,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-1.i [2025-03-04 14:44:50,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceddb9725/8bad312133fb495eb8f1da906600809d/FLAGbf5ca8d9c [2025-03-04 14:44:50,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:44:50,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-1.i [2025-03-04 14:44:50,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceddb9725/8bad312133fb495eb8f1da906600809d/FLAGbf5ca8d9c [2025-03-04 14:44:50,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceddb9725/8bad312133fb495eb8f1da906600809d [2025-03-04 14:44:50,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:44:50,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:44:50,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:44:50,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:44:50,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:44:50,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:44:50" (1/1) ... [2025-03-04 14:44:50,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7cb0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:50, skipping insertion in model container [2025-03-04 14:44:50,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:44:50" (1/1) ... [2025-03-04 14:44:50,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:44:51,109 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:44:51,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:44:51,115 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:44:51,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:44:51,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:44:51,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:44:51,124 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:44:51,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:44:51,126 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:44:51,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:44:51,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:44:51,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:44:51,133 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:44:51,143 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:44:51,145 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:44:51,155 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:44:51,166 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:44:51,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:44:51,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:44:51,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:44:51,438 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:44:51,445 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:44:51,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51 WrapperNode [2025-03-04 14:44:51,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:44:51,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:44:51,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:44:51,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:44:51,451 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:44:51" (1/1) ... [2025-03-04 14:44:51,482 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:44:51" (1/1) ... [2025-03-04 14:44:51,526 INFO L138 Inliner]: procedures = 624, calls = 509, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 797 [2025-03-04 14:44:51,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:44:51,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:44:51,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:44:51,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:44:51,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,553 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:44:51,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:44:51,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:44:51,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:44:51,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:44:51,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (1/1) ... [2025-03-04 14:44:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:44:51,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:51,660 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:44:51,662 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:44:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:44:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-04 14:44:51,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-04 14:44:51,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-04 14:44:51,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:44:51,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:44:51,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:44:51,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:44:51,681 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:44:51,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-04 14:44:51,681 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-04 14:44:51,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:44:51,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-04 14:44:51,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-04 14:44:51,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-04 14:44:51,948 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:44:51,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:44:53,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: havoc bb_internal_getpwuid_#t~ret119#1.base, bb_internal_getpwuid_#t~ret119#1.offset; [2025-03-04 14:44:53,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: havoc xuid2uname_#t~mem115#1.base, xuid2uname_#t~mem115#1.offset; [2025-03-04 14:44:53,176 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-03-04 14:44:53,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:44:53,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:44:53,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:44:53,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:53 BoogieIcfgContainer [2025-03-04 14:44:53,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:44:53,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:44:53,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:44:53,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:44:53,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:44:50" (1/3) ... [2025-03-04 14:44:53,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecdb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:44:53, skipping insertion in model container [2025-03-04 14:44:53,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:51" (2/3) ... [2025-03-04 14:44:53,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecdb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:44:53, skipping insertion in model container [2025-03-04 14:44:53,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:53" (3/3) ... [2025-03-04 14:44:53,191 INFO L128 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-1.i [2025-03-04 14:44:53,200 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:44:53,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG whoami-incomplete-1.i that has 4 procedures, 159 locations, 1 initial locations, 11 loop locations, and 40 error locations. [2025-03-04 14:44:53,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:44:53,257 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;@2c7b87b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:44:53,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 14:44:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 108 states have (on average 1.6481481481481481) internal successors, (178), 148 states have internal predecessors, (178), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 14:44:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:44:53,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:53,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:44:53,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 7325567, now seen corresponding path program 1 times [2025-03-04 14:44:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619016657] [2025-03-04 14:44:53,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:53,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:53,285 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:44:53,288 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:44:53,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:44:53,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:44:53,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:53,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:53,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 14:44:53,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:53,978 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:44:53,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:53,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:44:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619016657] [2025-03-04 14:44:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619016657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:53,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:44:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307104494] [2025-03-04 14:44:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:44:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:44:53,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:44:53,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:44:53,995 INFO L87 Difference]: Start difference. First operand has 159 states, 108 states have (on average 1.6481481481481481) internal successors, (178), 148 states have internal predecessors, (178), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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:44:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:54,015 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2025-03-04 14:44:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:44:54,017 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:44:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:54,020 INFO L225 Difference]: With dead ends: 197 [2025-03-04 14:44:54,020 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 14:44:54,022 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:44:54,025 INFO L435 NwaCegarLoop]: 50 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, 50 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:44:54,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 14:44:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 14:44:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 40 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-04 14:44:54,054 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 4 [2025-03-04 14:44:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:54,054 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-04 14:44:54,054 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:44:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-04 14:44:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:44:54,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:54,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:44:54,080 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:44:54,256 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:44:54,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:54,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash 227092749, now seen corresponding path program 1 times [2025-03-04 14:44:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:54,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246188678] [2025-03-04 14:44:54,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:54,263 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:44:54,264 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:44:54,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:44:54,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:44:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:54,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:44:54,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:54,939 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:44:54,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:54,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:44:54,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246188678] [2025-03-04 14:44:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246188678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:54,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956532085] [2025-03-04 14:44:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:44:54,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:54,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:54,941 INFO L87 Difference]: Start difference. First operand 44 states and 49 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:44:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:54,970 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-03-04 14:44:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:54,971 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:44:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:54,971 INFO L225 Difference]: With dead ends: 86 [2025-03-04 14:44:54,971 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 14:44:54,972 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:44:54,972 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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:44:54,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 14:44:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 14:44:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-04 14:44:54,978 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 5 [2025-03-04 14:44:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:54,978 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-04 14:44:54,978 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:44:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-04 14:44:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:44:54,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:54,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:44:55,012 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:44:55,179 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:44:55,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:55,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash 746768961, now seen corresponding path program 1 times [2025-03-04 14:44:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181164343] [2025-03-04 14:44:55,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:55,186 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:44:55,188 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:44:55,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:44:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:44:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:55,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:55,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:55,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:55,853 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:44:55,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:55,888 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:44:55,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:44:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181164343] [2025-03-04 14:44:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181164343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:55,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:44:55,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:44:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242603446] [2025-03-04 14:44:55,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:55,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:44:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:44:55,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:44:55,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:55,890 INFO L87 Difference]: Start difference. First operand 47 states and 52 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:44:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:55,960 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2025-03-04 14:44:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:55,961 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:44:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:55,962 INFO L225 Difference]: With dead ends: 89 [2025-03-04 14:44:55,962 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 14:44:55,962 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:44:55,963 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:55,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 14:44:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-04 14:44:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-04 14:44:55,969 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 8 [2025-03-04 14:44:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:55,969 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-04 14:44:55,970 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:44:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-04 14:44:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 14:44:55,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:55,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:56,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:44:56,170 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:44:56,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 621856226, now seen corresponding path program 1 times [2025-03-04 14:44:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944393595] [2025-03-04 14:44:56,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:56,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:56,174 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:44:56,175 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:44:56,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 14:44:56,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 14:44:56,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:56,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:44:56,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:56,872 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:44:56,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:56,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:44:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944393595] [2025-03-04 14:44:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944393595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:56,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767777541] [2025-03-04 14:44:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:56,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:44:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:44:56,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:44:56,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:56,874 INFO L87 Difference]: Start difference. First operand 47 states and 52 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:44:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:57,049 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-03-04 14:44:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:44:57,057 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:44:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:57,057 INFO L225 Difference]: With dead ends: 47 [2025-03-04 14:44:57,057 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 14:44:57,057 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:44:57,059 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:57,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 14:44:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 14:44:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 41 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-04 14:44:57,063 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 16 [2025-03-04 14:44:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-04 14:44:57,064 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:44:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-04 14:44:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:44:57,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:57,064 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:44:57,097 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:44:57,265 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:44:57,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:57,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash 419070616, now seen corresponding path program 1 times [2025-03-04 14:44:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:57,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87659091] [2025-03-04 14:44:57,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:57,278 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:44:57,279 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:44:57,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:44:57,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:44:57,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:57,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:57,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:44:57,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:57,960 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:44:57,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:57,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:44:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87659091] [2025-03-04 14:44:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87659091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:57,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:57,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664526947] [2025-03-04 14:44:57,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:57,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:44:57,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:57,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:57,963 INFO L87 Difference]: Start difference. First operand 45 states and 50 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:44:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:58,066 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-03-04 14:44:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:58,066 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:44:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:58,067 INFO L225 Difference]: With dead ends: 53 [2025-03-04 14:44:58,067 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 14:44:58,067 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:44:58,068 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 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:44:58,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 14:44:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-04 14:44:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-04 14:44:58,071 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 22 [2025-03-04 14:44:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:58,071 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-04 14:44:58,071 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:44:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-04 14:44:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:44:58,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:58,071 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:44:58,103 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:44:58,272 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:44:58,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:58,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 419075581, now seen corresponding path program 1 times [2025-03-04 14:44:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746809062] [2025-03-04 14:44:58,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:58,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:58,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:58,276 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:44:58,278 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:44:58,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:44:58,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:44:58,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:58,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:58,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:44:58,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:58,976 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:44:58,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:58,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:44:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746809062] [2025-03-04 14:44:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746809062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:58,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678245935] [2025-03-04 14:44:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:58,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:44:58,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:58,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:58,977 INFO L87 Difference]: Start difference. First operand 51 states and 59 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:44:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:59,013 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2025-03-04 14:44:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:59,014 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:44:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:59,014 INFO L225 Difference]: With dead ends: 86 [2025-03-04 14:44:59,014 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 14:44:59,014 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:44:59,015 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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:44:59,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 14:44:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 14:44:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.24) internal successors, (62), 53 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-03-04 14:44:59,018 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 22 [2025-03-04 14:44:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-04 14:44:59,018 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:44:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-03-04 14:44:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:44:59,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:59,019 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:44:59,052 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:44:59,219 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:44:59,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:44:59,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash -789137087, now seen corresponding path program 1 times [2025-03-04 14:44:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:44:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798420327] [2025-03-04 14:44:59,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:59,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:59,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:59,223 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:44:59,235 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:44:59,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:44:59,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:44:59,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:59,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:59,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:59,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:59,980 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:44:59,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:45:00,035 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:45:00,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:45:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798420327] [2025-03-04 14:45:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798420327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:45:00,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:45:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:45:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142176765] [2025-03-04 14:45:00,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:45:00,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:45:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:45:00,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:45:00,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:45:00,036 INFO L87 Difference]: Start difference. First operand 57 states and 65 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:45:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:45:00,152 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2025-03-04 14:45:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:45:00,153 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:45:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:45:00,153 INFO L225 Difference]: With dead ends: 96 [2025-03-04 14:45:00,153 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 14:45:00,154 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:45:00,154 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:45:00,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:45:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 14:45:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-03-04 14:45:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-04 14:45:00,159 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 25 [2025-03-04 14:45:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:45:00,159 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-04 14:45:00,159 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:45:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-04 14:45:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 14:45:00,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:45:00,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:45:00,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:45:00,360 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:45:00,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:45:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:45:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -58648313, now seen corresponding path program 1 times [2025-03-04 14:45:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:45:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766188963] [2025-03-04 14:45:00,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:00,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:45:00,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:45:00,363 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:45:00,364 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:45:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 14:45:00,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 14:45:00,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:00,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:01,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:45:01,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:45:01,088 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:45:01,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:45:01,088 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:45:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766188963] [2025-03-04 14:45:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766188963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:45:01,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:45:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:45:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995264985] [2025-03-04 14:45:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:45:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:45:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:45:01,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:45:01,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:45:01,089 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:45:01,394 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-03-04 14:45:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:45:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 14:45:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:45:01,395 INFO L225 Difference]: With dead ends: 77 [2025-03-04 14:45:01,395 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 14:45:01,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:45:01,395 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:45:01,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 138 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:45:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 14:45:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 14:45:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-03-04 14:45:01,399 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 29 [2025-03-04 14:45:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:45:01,399 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-03-04 14:45:01,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-03-04 14:45:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:45:01,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:45:01,400 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:45:01,430 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:45:01,600 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:45:01,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:45:01,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:45:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 611502160, now seen corresponding path program 1 times [2025-03-04 14:45:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:45:01,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201902975] [2025-03-04 14:45:01,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:01,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:45:01,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:45:01,603 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:45:01,604 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:45:01,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:45:02,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:45:02,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:02,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:45:02,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:45:02,432 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:45:02,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:45:02,495 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:45:02,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:45:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201902975] [2025-03-04 14:45:02,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201902975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:45:02,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:45:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:45:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677862344] [2025-03-04 14:45:02,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:45:02,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:45:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:45:02,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:45:02,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:45:02,496 INFO L87 Difference]: Start difference. First operand 58 states and 64 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:45:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:45:02,740 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-03-04 14:45:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:45:02,740 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:45:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:45:02,742 INFO L225 Difference]: With dead ends: 79 [2025-03-04 14:45:02,742 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 14:45:02,742 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:45:02,742 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:45:02,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:45:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 14:45:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2025-03-04 14:45:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-04 14:45:02,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2025-03-04 14:45:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:45:02,749 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-04 14:45:02,749 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:45:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-04 14:45:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 14:45:02,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:45:02,749 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, 1, 1, 1, 1] [2025-03-04 14:45:02,782 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:45:02,950 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:45:02,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:45:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:45:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -845650993, now seen corresponding path program 1 times [2025-03-04 14:45:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:45:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052859018] [2025-03-04 14:45:02,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:45:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:45:02,954 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:45:02,954 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:45:03,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 14:45:03,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 14:45:03,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:03,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:03,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:45:03,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:45:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 14:45:03,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:45:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 14:45:03,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:45:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052859018] [2025-03-04 14:45:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052859018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:45:03,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:45:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:45:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297380423] [2025-03-04 14:45:03,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:45:03,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:45:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:45:03,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:45:03,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:45:03,843 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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:45:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:45:03,930 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-03-04 14:45:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:45:03,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 39 [2025-03-04 14:45:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:45:03,934 INFO L225 Difference]: With dead ends: 99 [2025-03-04 14:45:03,934 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 14:45:03,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:45:03,935 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 158 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:45:03,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 158 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:45:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 14:45:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 14:45:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-04 14:45:03,940 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 39 [2025-03-04 14:45:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:45:03,940 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-04 14:45:03,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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:45:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-04 14:45:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:45:03,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:45:03,941 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 14:45:03,977 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:45:04,142 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:45:04,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-04 14:45:04,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:45:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash -132248881, now seen corresponding path program 2 times [2025-03-04 14:45:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:45:04,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258053214] [2025-03-04 14:45:04,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:45:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:45:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:45:04,145 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:45:04,146 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:45:04,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 14:46:12,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:46:12,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:46:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:46:12,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:46:12,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:46:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 14:46:12,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:46:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 14:46:12,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:46:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258053214] [2025-03-04 14:46:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258053214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:46:12,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:46:12,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:46:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569429128] [2025-03-04 14:46:12,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:46:12,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:46:12,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:46:12,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:46:12,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:46:12,991 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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)