./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-09 05:57:31,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:57:31,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:57:31,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:57:31,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:57:31,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:57:31,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:57:31,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:57:31,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:57:31,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:57:31,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:57:31,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:57:31,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:57:31,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:57:31,717 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:57:31,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:57:31,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:57:31,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:57:31,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:57:31,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:57:31,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:57:31,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:57:31,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:57:31,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:57:31,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:57:31,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:57:31,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:57:31,720 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:57:31,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:57:31,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:57:31,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:57:31,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:57:31,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:57:31,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:57:31,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:57:31,721 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-09 05:57:31,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:57:31,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:57:31,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:57:31,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:57:31,937 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:57:31,938 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-09 05:57:33,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07702ca12/bb7851c61c44401fba1ae15001ac6a04/FLAG0713d3127 [2025-03-09 05:57:33,345 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:57:33,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-1.i [2025-03-09 05:57:33,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07702ca12/bb7851c61c44401fba1ae15001ac6a04/FLAG0713d3127 [2025-03-09 05:57:33,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07702ca12/bb7851c61c44401fba1ae15001ac6a04 [2025-03-09 05:57:33,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:57:33,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:57:33,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:57:33,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:57:33,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:57:33,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1324bb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:33, skipping insertion in model container [2025-03-09 05:57:33,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:33" (1/1) ... [2025-03-09 05:57:33,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:57:34,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:57:34,306 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:57:34,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:57:34,489 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:57:34,494 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:57:34,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34 WrapperNode [2025-03-09 05:57:34,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:57:34,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:57:34,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:57:34,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:57:34,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,582 INFO L138 Inliner]: procedures = 613, calls = 509, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 817 [2025-03-09 05:57:34,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:57:34,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:57:34,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:57:34,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:57:34,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,613 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:57:34,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:57:34,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:57:34,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:57:34,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:57:34,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (1/1) ... [2025-03-09 05:57:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:57:34,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:34,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:57:34,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:57:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:57:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:57:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:57:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-09 05:57:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:57:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:57:34,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:57:34,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:57:35,472 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: havoc bb_internal_getpwuid_#t~ret120#1.base, bb_internal_getpwuid_#t~ret120#1.offset; [2025-03-09 05:57:35,472 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: havoc xuid2uname_#t~mem116#1.base, xuid2uname_#t~mem116#1.offset; [2025-03-09 05:57:35,527 INFO L? ?]: Removed 245 outVars from TransFormulas that were not future-live. [2025-03-09 05:57:35,527 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:57:35,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:57:35,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:57:35,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:35 BoogieIcfgContainer [2025-03-09 05:57:35,540 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:57:35,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:57:35,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:57:35,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:57:35,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:57:33" (1/3) ... [2025-03-09 05:57:35,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ba93e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:35, skipping insertion in model container [2025-03-09 05:57:35,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:34" (2/3) ... [2025-03-09 05:57:35,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ba93e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:35, skipping insertion in model container [2025-03-09 05:57:35,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:35" (3/3) ... [2025-03-09 05:57:35,546 INFO L128 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-1.i [2025-03-09 05:57:35,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:57:35,557 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-09 05:57:35,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:57:35,602 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;@39db2d43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:57:35,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 05:57:35,607 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-09 05:57:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:57:35,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:35,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:57:35,612 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-09 05:57:35,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash 7510271, now seen corresponding path program 1 times [2025-03-09 05:57:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537043812] [2025-03-09 05:57:35,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:35,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:35,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:57:35,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:57:35,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:35,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:57:36,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537043812] [2025-03-09 05:57:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537043812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:36,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:36,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914463892] [2025-03-09 05:57:36,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:36,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:36,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:36,098 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-09 05:57:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:36,139 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2025-03-09 05:57:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:36,141 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-09 05:57:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:36,145 INFO L225 Difference]: With dead ends: 210 [2025-03-09 05:57:36,145 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 05:57:36,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:36,151 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-09 05:57:36,153 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-09 05:57:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 05:57:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 05:57:36,172 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-09 05:57:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-09 05:57:36,177 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 4 [2025-03-09 05:57:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:36,177 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-09 05:57:36,177 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-09 05:57:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-09 05:57:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:57:36,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:36,177 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:57:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:57:36,177 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-09 05:57:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 400360849, now seen corresponding path program 1 times [2025-03-09 05:57:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865800886] [2025-03-09 05:57:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:36,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:57:36,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:57:36,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:36,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:36,385 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-09 05:57:36,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865800886] [2025-03-09 05:57:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865800886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881309629] [2025-03-09 05:57:36,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:36,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:36,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:57:36,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:57:36,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:57:36,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:36,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:36,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:57:36,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881309629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:36,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:57:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802848313] [2025-03-09 05:57:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:36,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:57:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:36,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:57:36,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:36,668 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-09 05:57:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:36,688 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-09 05:57:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:57:36,689 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-09 05:57:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:36,689 INFO L225 Difference]: With dead ends: 52 [2025-03-09 05:57:36,689 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 05:57:36,689 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-09 05:57:36,690 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-09 05:57:36,690 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-09 05:57:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 05:57:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-09 05:57:36,693 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-09 05:57:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-09 05:57:36,693 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 7 [2025-03-09 05:57:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:36,694 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-09 05:57:36,694 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-09 05:57:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-09 05:57:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:57:36,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:36,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:57:36,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:36,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:36,895 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-09 05:57:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -473715391, now seen corresponding path program 1 times [2025-03-09 05:57:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879023549] [2025-03-09 05:57:36,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:36,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:57:36,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:57:36,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:36,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,033 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-09 05:57:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:37,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879023549] [2025-03-09 05:57:37,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879023549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:37,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686686761] [2025-03-09 05:57:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:37,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:37,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:37,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:37,037 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-09 05:57:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:37,054 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 05:57:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:37,055 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-09 05:57:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:37,055 INFO L225 Difference]: With dead ends: 51 [2025-03-09 05:57:37,056 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 05:57:37,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:37,056 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-09 05:57:37,056 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-09 05:57:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 05:57:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-09 05:57:37,059 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-09 05:57:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 05:57:37,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 8 [2025-03-09 05:57:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:37,060 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 05:57:37,060 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-09 05:57:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 05:57:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:57:37,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:37,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:37,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:57:37,061 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-09 05:57:37,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash -556425046, now seen corresponding path program 1 times [2025-03-09 05:57:37,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:37,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477017569] [2025-03-09 05:57:37,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:37,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:57:37,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:57:37,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:37,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,254 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-09 05:57:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:37,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477017569] [2025-03-09 05:57:37,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477017569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:37,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236101254] [2025-03-09 05:57:37,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:37,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:37,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:37,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:57:37,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:57:37,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:57:37,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:37,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:57:37,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:57:37,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236101254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:57:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993157751] [2025-03-09 05:57:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:37,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:37,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:37,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:37,518 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-09 05:57:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:37,543 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-09 05:57:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:37,544 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-09 05:57:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:37,545 INFO L225 Difference]: With dead ends: 48 [2025-03-09 05:57:37,545 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 05:57:37,545 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-09 05:57:37,545 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-09 05:57:37,545 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-09 05:57:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 05:57:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-09 05:57:37,549 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-09 05:57:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-09 05:57:37,550 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 12 [2025-03-09 05:57:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:37,550 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-09 05:57:37,550 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-09 05:57:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-09 05:57:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:57:37,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:37,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:37,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:37,751 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-09 05:57:37,751 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-09 05:57:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -69307070, now seen corresponding path program 1 times [2025-03-09 05:57:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523335140] [2025-03-09 05:57:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:57:37,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:57:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,895 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-09 05:57:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523335140] [2025-03-09 05:57:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523335140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822110353] [2025-03-09 05:57:37,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:37,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:37,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:37,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:37,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:57:38,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:57:38,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:57:38,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:38,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:38,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:38,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:38,154 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-09 05:57:38,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:38,190 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-09 05:57:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822110353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:38,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:57:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573910331] [2025-03-09 05:57:38,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:38,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:38,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:38,192 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-09 05:57:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:38,218 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2025-03-09 05:57:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:38,221 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-09 05:57:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:38,222 INFO L225 Difference]: With dead ends: 95 [2025-03-09 05:57:38,222 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 05:57:38,222 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-09 05:57:38,223 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-09 05:57:38,223 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-09 05:57:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 05:57:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 05:57:38,230 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-09 05:57:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-03-09 05:57:38,231 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2025-03-09 05:57:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:38,231 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-03-09 05:57:38,231 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-09 05:57:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-03-09 05:57:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:57:38,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:38,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:38,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:57:38,432 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-09 05:57:38,432 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-09 05:57:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1789736016, now seen corresponding path program 2 times [2025-03-09 05:57:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165951914] [2025-03-09 05:57:38,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:38,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:57:38,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:57:38,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:57:38,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:38,677 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-09 05:57:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165951914] [2025-03-09 05:57:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165951914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:38,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:38,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435576088] [2025-03-09 05:57:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:38,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:57:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:38,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:57:38,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:38,680 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-09 05:57:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:38,720 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-03-09 05:57:38,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:38,721 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-09 05:57:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:38,722 INFO L225 Difference]: With dead ends: 55 [2025-03-09 05:57:38,722 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 05:57:38,722 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-09 05:57:38,722 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-09 05:57:38,722 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-09 05:57:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 05:57:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 05:57:38,729 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-09 05:57:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-09 05:57:38,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 22 [2025-03-09 05:57:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:38,730 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-09 05:57:38,730 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-09 05:57:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-09 05:57:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:57:38,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:38,730 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-09 05:57:38,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:57:38,730 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-09 05:57:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1951169545, now seen corresponding path program 1 times [2025-03-09 05:57:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:38,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965788439] [2025-03-09 05:57:38,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:38,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:57:38,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:57:38,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:38,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:38,928 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-09 05:57:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965788439] [2025-03-09 05:57:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965788439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811537847] [2025-03-09 05:57:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:38,930 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-09 05:57:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:38,953 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-03-09 05:57:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:38,954 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-09 05:57:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:38,955 INFO L225 Difference]: With dead ends: 85 [2025-03-09 05:57:38,956 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 05:57:38,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:38,956 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-09 05:57:38,957 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-09 05:57:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 05:57:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 05:57:38,959 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-09 05:57:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-09 05:57:38,960 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 27 [2025-03-09 05:57:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:38,960 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-09 05:57:38,960 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-09 05:57:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-09 05:57:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:57:38,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:38,961 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-09 05:57:38,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:57:38,961 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-09 05:57:38,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 795629961, now seen corresponding path program 1 times [2025-03-09 05:57:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227183155] [2025-03-09 05:57:38,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:38,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:57:39,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:57:39,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:39,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:39,125 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-09 05:57:39,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227183155] [2025-03-09 05:57:39,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227183155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130329954] [2025-03-09 05:57:39,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:39,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:39,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:39,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:39,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:57:39,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:57:39,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:57:39,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:39,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:39,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:39,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:39,457 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-09 05:57:39,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:39,529 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-09 05:57:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130329954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:39,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:57:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285402250] [2025-03-09 05:57:39,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:39,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:57:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:39,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:57:39,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:57:39,531 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-09 05:57:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:39,615 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2025-03-09 05:57:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:57:39,616 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-09 05:57:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:39,617 INFO L225 Difference]: With dead ends: 114 [2025-03-09 05:57:39,617 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 05:57:39,617 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-09 05:57:39,617 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-09 05:57:39,618 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-09 05:57:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 05:57:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 05:57:39,622 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-09 05:57:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-09 05:57:39,622 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 30 [2025-03-09 05:57:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-09 05:57:39,623 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-09 05:57:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-09 05:57:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 05:57:39,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:39,623 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-09 05:57:39,632 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-09 05:57:39,824 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-09 05:57:39,825 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-09 05:57:39,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:39,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1913124137, now seen corresponding path program 1 times [2025-03-09 05:57:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:39,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431714065] [2025-03-09 05:57:39,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:39,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:57:39,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:57:39,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:39,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:40,017 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-09 05:57:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431714065] [2025-03-09 05:57:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431714065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562773961] [2025-03-09 05:57:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:40,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:40,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:40,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:40,020 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-09 05:57:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:40,046 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-03-09 05:57:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:40,047 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-09 05:57:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:40,048 INFO L225 Difference]: With dead ends: 85 [2025-03-09 05:57:40,048 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 05:57:40,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:40,048 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-09 05:57:40,048 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-09 05:57:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 05:57:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-09 05:57:40,057 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-09 05:57:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-09 05:57:40,058 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 48 [2025-03-09 05:57:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:40,058 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-09 05:57:40,059 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-09 05:57:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-09 05:57:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:57:40,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:40,059 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-09 05:57:40,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:57:40,059 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-09 05:57:40,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash -822688775, now seen corresponding path program 1 times [2025-03-09 05:57:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711423016] [2025-03-09 05:57:40,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:57:40,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:57:40,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:40,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:40,198 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-09 05:57:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711423016] [2025-03-09 05:57:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711423016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361676354] [2025-03-09 05:57:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:40,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:40,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:40,199 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-09 05:57:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:40,208 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-03-09 05:57:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:40,209 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-09 05:57:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:40,209 INFO L225 Difference]: With dead ends: 82 [2025-03-09 05:57:40,209 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 05:57:40,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:40,210 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-09 05:57:40,210 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-09 05:57:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 05:57:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-09 05:57:40,213 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-09 05:57:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-09 05:57:40,214 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 49 [2025-03-09 05:57:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:40,214 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-09 05:57:40,214 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-09 05:57:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-09 05:57:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 05:57:40,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:40,215 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-09 05:57:40,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:57:40,215 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-09 05:57:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1852844674, now seen corresponding path program 1 times [2025-03-09 05:57:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229442294] [2025-03-09 05:57:40,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 05:57:40,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 05:57:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:40,421 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-09 05:57:40,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:40,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229442294] [2025-03-09 05:57:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229442294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:40,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:40,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:57:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840821711] [2025-03-09 05:57:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:40,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:40,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:40,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:40,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:40,422 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-09 05:57:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:40,431 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2025-03-09 05:57:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:40,432 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-09 05:57:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:40,433 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:57:40,433 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 05:57:40,433 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-09 05:57:40,434 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-09 05:57:40,434 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-09 05:57:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 05:57:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 05:57:40,441 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-09 05:57:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-03-09 05:57:40,441 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 53 [2025-03-09 05:57:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-03-09 05:57:40,442 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-09 05:57:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-03-09 05:57:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 05:57:40,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:40,442 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-09 05:57:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:57:40,442 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-09 05:57:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1852843713, now seen corresponding path program 1 times [2025-03-09 05:57:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782728495] [2025-03-09 05:57:40,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 05:57:40,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 05:57:40,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:40,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:40,812 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-09 05:57:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:40,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782728495] [2025-03-09 05:57:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782728495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:57:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755683246] [2025-03-09 05:57:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:40,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:57:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:40,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:57:40,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:40,814 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-09 05:57:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:40,855 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-03-09 05:57:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:40,856 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-09 05:57:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:40,856 INFO L225 Difference]: With dead ends: 96 [2025-03-09 05:57:40,856 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 05:57:40,856 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-09 05:57:40,857 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-09 05:57:40,857 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-09 05:57:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 05:57:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 05:57:40,860 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-09 05:57:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-03-09 05:57:40,860 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 53 [2025-03-09 05:57:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:40,860 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-03-09 05:57:40,861 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-09 05:57:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-03-09 05:57:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:57:40,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:40,861 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-09 05:57:40,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 05:57:40,861 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-09 05:57:40,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1119256591, now seen corresponding path program 1 times [2025-03-09 05:57:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:40,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539820239] [2025-03-09 05:57:40,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:40,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:57:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:57:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:41,064 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-09 05:57:41,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539820239] [2025-03-09 05:57:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539820239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97085000] [2025-03-09 05:57:41,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:41,067 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-09 05:57:41,068 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-09 05:57:41,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:57:41,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:57:41,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:41,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:41,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:41,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:41,403 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-09 05:57:41,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:41,425 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-09 05:57:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97085000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:41,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:57:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604298209] [2025-03-09 05:57:41,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:41,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:41,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:41,428 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-09 05:57:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:41,460 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2025-03-09 05:57:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:41,460 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-09 05:57:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:41,461 INFO L225 Difference]: With dead ends: 125 [2025-03-09 05:57:41,461 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 05:57:41,461 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-09 05:57:41,461 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-09 05:57:41,461 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-09 05:57:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 05:57:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-09 05:57:41,466 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-09 05:57:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2025-03-09 05:57:41,466 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 55 [2025-03-09 05:57:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2025-03-09 05:57:41,467 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-09 05:57:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2025-03-09 05:57:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 05:57:41,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:41,467 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-09 05:57:41,478 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-09 05:57:41,668 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-09 05:57:41,668 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-09 05:57:41,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2073731207, now seen corresponding path program 1 times [2025-03-09 05:57:41,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:41,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935900041] [2025-03-09 05:57:41,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:41,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 05:57:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 05:57:41,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:41,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:41,929 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-09 05:57:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935900041] [2025-03-09 05:57:41,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935900041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328047626] [2025-03-09 05:57:41,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:41,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:41,932 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-09 05:57:41,933 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-09 05:57:42,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 05:57:42,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 05:57:42,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:42,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:42,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:42,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:42,350 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-09 05:57:42,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:42,409 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-09 05:57:42,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328047626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:42,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:42,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:57:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629116212] [2025-03-09 05:57:42,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:42,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:57:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:42,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:57:42,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:57:42,412 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-09 05:57:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:42,470 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2025-03-09 05:57:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:57:42,471 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-09 05:57:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:42,471 INFO L225 Difference]: With dead ends: 170 [2025-03-09 05:57:42,471 INFO L226 Difference]: Without dead ends: 131 [2025-03-09 05:57:42,472 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-09 05:57:42,473 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-09 05:57:42,473 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-09 05:57:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-09 05:57:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-09 05:57:42,480 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-09 05:57:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2025-03-09 05:57:42,480 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 69 [2025-03-09 05:57:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:42,481 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2025-03-09 05:57:42,481 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-09 05:57:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2025-03-09 05:57:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 05:57:42,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:42,482 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-09 05:57:42,491 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-09 05:57:42,686 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-09 05:57:42,686 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-09 05:57:42,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash -146342713, now seen corresponding path program 2 times [2025-03-09 05:57:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373174815] [2025-03-09 05:57:42,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:42,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-09 05:57:43,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 05:57:43,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:57:43,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:57:43,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 05:57:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 05:57:43,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 05:57:43,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:43,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:57:43,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 05:57:43,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 05:57:43,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE (39 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (38 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2025-03-09 05:57:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2025-03-09 05:57:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2025-03-09 05:57:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2025-03-09 05:57:43,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2025-03-09 05:57:43,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2025-03-09 05:57:43,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 40 remaining) [2025-03-09 05:57:43,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2025-03-09 05:57:43,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2025-03-09 05:57:43,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2025-03-09 05:57:43,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2025-03-09 05:57:43,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:57:43,377 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:43,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:57:43,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:57:43 BoogieIcfgContainer [2025-03-09 05:57:43,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:57:43,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:57:43,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:57:43,489 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:57:43,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:35" (3/4) ... [2025-03-09 05:57:43,492 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 05:57:43,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:57:43,494 INFO L158 Benchmark]: Toolchain (without parser) took 9907.30ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 119.7MB in the beginning and 336.4MB in the end (delta: -216.7MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2025-03-09 05:57:43,494 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:57:43,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 907.73ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 36.7MB in the end (delta: 83.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-09 05:57:43,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.27ms. Allocated memory is still 167.8MB. Free memory was 36.7MB in the beginning and 110.9MB in the end (delta: -74.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-03-09 05:57:43,494 INFO L158 Benchmark]: Boogie Preprocessor took 91.10ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 104.2MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:57:43,495 INFO L158 Benchmark]: IcfgBuilder took 865.13ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 96.6MB in the end (delta: 7.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 05:57:43,495 INFO L158 Benchmark]: TraceAbstraction took 7947.35ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 95.6MB in the beginning and 336.4MB in the end (delta: -240.9MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2025-03-09 05:57:43,495 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 385.9MB. Free memory was 336.4MB in the beginning and 336.4MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:57:43,496 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.19ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 907.73ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 36.7MB in the end (delta: 83.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.27ms. Allocated memory is still 167.8MB. Free memory was 36.7MB in the beginning and 110.9MB in the end (delta: -74.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.10ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 104.2MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 865.13ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 96.6MB in the end (delta: 7.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7947.35ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 95.6MB in the beginning and 336.4MB in the end (delta: -240.9MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 385.9MB. Free memory was 336.4MB in the beginning and 336.4MB in the end (delta: 41.0kB). 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-09 05:57:45,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:57:45,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:57:45,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:57:45,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:57:45,822 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:57:45,822 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-09 05:57:46,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab300ba3/8f2bef67dcb44df397619874856fbf6d/FLAGa0c16f99b [2025-03-09 05:57:47,323 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:57:47,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-1.i [2025-03-09 05:57:47,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab300ba3/8f2bef67dcb44df397619874856fbf6d/FLAGa0c16f99b [2025-03-09 05:57:47,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab300ba3/8f2bef67dcb44df397619874856fbf6d [2025-03-09 05:57:47,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:57:47,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:57:47,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:57:47,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:57:47,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:57:47,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:47" (1/1) ... [2025-03-09 05:57:47,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2899030b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:47, skipping insertion in model container [2025-03-09 05:57:47,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:47" (1/1) ... [2025-03-09 05:57:47,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:57:47,967 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-09 05:57:47,972 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-09 05:57:47,974 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-09 05:57:47,975 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-09 05:57:47,977 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-09 05:57:47,978 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-09 05:57:47,978 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-09 05:57:47,979 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-09 05:57:47,980 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-09 05:57:47,983 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-09 05:57:47,986 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-09 05:57:47,991 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-09 05:57:47,992 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-09 05:57:47,999 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-09 05:57:48,001 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-09 05:57:48,011 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-09 05:57:48,021 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-09 05:57:48,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:57:48,055 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:57:48,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:57:48,342 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:57:48,350 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:57:48,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48 WrapperNode [2025-03-09 05:57:48,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:57:48,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:57:48,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:57:48,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:57:48,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,413 INFO L138 Inliner]: procedures = 624, calls = 509, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 797 [2025-03-09 05:57:48,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:57:48,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:57:48,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:57:48,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:57:48,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,453 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:57:48,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,485 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:57:48,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:57:48,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:57:48,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:57:48,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (1/1) ... [2025-03-09 05:57:48,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:57:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:48,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:57:48,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:57:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:57:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-09 05:57:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-09 05:57:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-09 05:57:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:57:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:57:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:57:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-09 05:57:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:57:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:57:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:57:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-09 05:57:48,549 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-09 05:57:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-09 05:57:48,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:57:48,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:57:49,901 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: havoc bb_internal_getpwuid_#t~ret119#1.base, bb_internal_getpwuid_#t~ret119#1.offset; [2025-03-09 05:57:49,901 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: havoc xuid2uname_#t~mem115#1.base, xuid2uname_#t~mem115#1.offset; [2025-03-09 05:57:49,954 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2025-03-09 05:57:49,954 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:57:49,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:57:49,965 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:57:49,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:49 BoogieIcfgContainer [2025-03-09 05:57:49,965 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:57:49,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:57:49,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:57:49,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:57:49,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:57:47" (1/3) ... [2025-03-09 05:57:49,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe3828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:49, skipping insertion in model container [2025-03-09 05:57:49,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:48" (2/3) ... [2025-03-09 05:57:49,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe3828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:49, skipping insertion in model container [2025-03-09 05:57:49,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:57:49" (3/3) ... [2025-03-09 05:57:49,973 INFO L128 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-1.i [2025-03-09 05:57:49,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:57:49,987 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-09 05:57:50,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:57:50,043 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;@23ee0efd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:57:50,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 05:57:50,047 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-09 05:57:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:57:50,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:50,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:57:50,052 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-09 05:57:50,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash 7325567, now seen corresponding path program 1 times [2025-03-09 05:57:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68121805] [2025-03-09 05:57:50,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:50,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:50,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:50,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:50,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:57:50,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:57:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:57:50,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:50,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:50,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 05:57:50,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:57:50,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:50,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:50,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68121805] [2025-03-09 05:57:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68121805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:50,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 05:57:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661000488] [2025-03-09 05:57:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:50,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 05:57:50,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:50,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 05:57:50,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:57:50,788 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-09 05:57:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:50,801 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2025-03-09 05:57:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 05:57:50,802 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-09 05:57:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:50,806 INFO L225 Difference]: With dead ends: 197 [2025-03-09 05:57:50,806 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 05:57:50,808 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-09 05:57:50,809 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-09 05:57:50,810 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-09 05:57:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 05:57:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 05:57:50,834 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-09 05:57:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-09 05:57:50,838 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 4 [2025-03-09 05:57:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:50,839 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-09 05:57:50,839 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-09 05:57:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-09 05:57:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 05:57:50,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:50,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 05:57:50,868 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-09 05:57:51,040 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-09 05:57:51,041 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-09 05:57:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 227092749, now seen corresponding path program 1 times [2025-03-09 05:57:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:51,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841356654] [2025-03-09 05:57:51,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:51,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:57:51,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 05:57:51,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 05:57:51,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:51,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:51,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:57:51,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:57:51,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:51,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841356654] [2025-03-09 05:57:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841356654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182151642] [2025-03-09 05:57:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:51,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:51,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:51,730 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-09 05:57:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:51,765 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-03-09 05:57:51,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:51,768 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-09 05:57:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:51,769 INFO L225 Difference]: With dead ends: 86 [2025-03-09 05:57:51,769 INFO L226 Difference]: Without dead ends: 47 [2025-03-09 05:57:51,769 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-09 05:57:51,770 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-09 05:57:51,770 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-09 05:57:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-09 05:57:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-09 05:57:51,775 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-09 05:57:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-09 05:57:51,775 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 5 [2025-03-09 05:57:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:51,776 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-09 05:57:51,776 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-09 05:57:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-09 05:57:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:57:51,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:51,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:57:51,811 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-09 05:57:51,976 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-09 05:57:51,977 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-09 05:57:51,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash 746768961, now seen corresponding path program 1 times [2025-03-09 05:57:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:51,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583676874] [2025-03-09 05:57:51,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:51,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:51,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:51,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:51,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:57:52,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:57:52,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:57:52,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:52,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:52,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:52,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:52,715 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-09 05:57:52,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:52,752 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-09 05:57:52,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583676874] [2025-03-09 05:57:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583676874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:52,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:57:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:57:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425196059] [2025-03-09 05:57:52,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:52,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:57:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:52,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:57:52,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:52,753 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-09 05:57:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:52,832 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2025-03-09 05:57:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:52,833 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-09 05:57:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:52,834 INFO L225 Difference]: With dead ends: 89 [2025-03-09 05:57:52,834 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 05:57:52,834 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-09 05:57:52,835 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-09 05:57:52,835 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-09 05:57:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 05:57:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-09 05:57:52,841 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-09 05:57:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-09 05:57:52,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 8 [2025-03-09 05:57:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-09 05:57:52,843 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-09 05:57:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-09 05:57:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:57:52,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:52,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:52,876 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-09 05:57:53,044 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-09 05:57:53,044 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-09 05:57:53,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 621856226, now seen corresponding path program 1 times [2025-03-09 05:57:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:53,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9574334] [2025-03-09 05:57:53,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:53,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:53,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:57:53,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:57:53,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:57:53,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:53,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:53,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:57:53,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:53,712 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-09 05:57:53,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:53,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:53,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9574334] [2025-03-09 05:57:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9574334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:53,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:53,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104999277] [2025-03-09 05:57:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:53,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:57:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:53,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:57:53,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:53,714 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-09 05:57:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:53,868 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-03-09 05:57:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:53,874 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-09 05:57:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:53,874 INFO L225 Difference]: With dead ends: 47 [2025-03-09 05:57:53,875 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 05:57:53,875 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-09 05:57:53,877 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:53,877 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.1s Time] [2025-03-09 05:57:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 05:57:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 05:57:53,883 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-09 05:57:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-09 05:57:53,885 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 16 [2025-03-09 05:57:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:53,885 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-09 05:57:53,885 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-09 05:57:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-09 05:57:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:57:53,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:53,886 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-09 05:57:53,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:54,086 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-09 05:57:54,086 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-09 05:57:54,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 419070616, now seen corresponding path program 1 times [2025-03-09 05:57:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234775538] [2025-03-09 05:57:54,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:54,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:54,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:54,090 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-09 05:57:54,092 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-09 05:57:54,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:57:54,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:57:54,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:54,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:54,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:57:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:54,741 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-09 05:57:54,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:54,741 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:54,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234775538] [2025-03-09 05:57:54,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234775538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:54,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863526283] [2025-03-09 05:57:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:54,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:54,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:54,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:54,743 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-09 05:57:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:54,808 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-03-09 05:57:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:54,808 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-09 05:57:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:54,809 INFO L225 Difference]: With dead ends: 53 [2025-03-09 05:57:54,809 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 05:57:54,809 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-09 05:57:54,810 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-09 05:57:54,810 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-09 05:57:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 05:57:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-09 05:57:54,812 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-09 05:57:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-09 05:57:54,813 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 22 [2025-03-09 05:57:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:54,814 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-09 05:57:54,814 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-09 05:57:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-09 05:57:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:57:54,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:54,814 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-09 05:57:54,849 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-09 05:57:55,014 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-09 05:57:55,015 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-09 05:57:55,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash 419075581, now seen corresponding path program 1 times [2025-03-09 05:57:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898172994] [2025-03-09 05:57:55,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:55,018 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-09 05:57:55,018 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-09 05:57:55,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:57:55,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:57:55,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:55,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:55,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:57:55,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:55,703 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-09 05:57:55,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:55,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:55,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898172994] [2025-03-09 05:57:55,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898172994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:55,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:55,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:55,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259879461] [2025-03-09 05:57:55,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:55,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:55,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:55,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:55,704 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-09 05:57:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:55,741 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2025-03-09 05:57:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:55,742 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-09 05:57:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:55,743 INFO L225 Difference]: With dead ends: 86 [2025-03-09 05:57:55,743 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 05:57:55,743 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-09 05:57:55,743 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-09 05:57:55,744 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-09 05:57:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 05:57:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-09 05:57:55,751 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-09 05:57:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-03-09 05:57:55,753 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 22 [2025-03-09 05:57:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:55,753 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-09 05:57:55,753 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-09 05:57:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-03-09 05:57:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 05:57:55,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:55,754 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-09 05:57:55,785 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-09 05:57:55,954 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-09 05:57:55,955 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-09 05:57:55,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -789137087, now seen corresponding path program 1 times [2025-03-09 05:57:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:55,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954183025] [2025-03-09 05:57:55,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:55,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:55,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:55,958 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-09 05:57:55,959 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-09 05:57:56,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 05:57:56,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 05:57:56,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:56,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:56,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:56,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:56,735 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-09 05:57:56,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:56,779 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-09 05:57:56,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:56,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954183025] [2025-03-09 05:57:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954183025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:56,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:57:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:57:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128859875] [2025-03-09 05:57:56,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:56,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:57:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:56,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:57:56,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:56,780 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-09 05:57:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:56,908 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2025-03-09 05:57:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:56,910 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-09 05:57:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:56,911 INFO L225 Difference]: With dead ends: 96 [2025-03-09 05:57:56,911 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 05:57:56,911 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-09 05:57:56,912 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-09 05:57:56,912 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-09 05:57:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 05:57:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-03-09 05:57:56,919 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-09 05:57:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-09 05:57:56,920 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 25 [2025-03-09 05:57:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:56,920 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-09 05:57:56,921 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-09 05:57:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-09 05:57:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 05:57:56,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:56,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:56,955 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-09 05:57:57,122 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-09 05:57:57,122 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-09 05:57:57,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -58648313, now seen corresponding path program 1 times [2025-03-09 05:57:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255649910] [2025-03-09 05:57:57,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:57,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:57,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:57,125 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-09 05:57:57,126 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-09 05:57:57,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 05:57:57,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 05:57:57,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:57,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:57,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:57:57,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:57,922 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-09 05:57:57,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:57,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:57,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255649910] [2025-03-09 05:57:57,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255649910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:57,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:57,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:57:57,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273403153] [2025-03-09 05:57:57,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:57,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:57:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:57,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:57:57,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:57,923 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-09 05:57:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:58,277 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-03-09 05:57:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:58,277 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-09 05:57:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:58,278 INFO L225 Difference]: With dead ends: 77 [2025-03-09 05:57:58,278 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 05:57:58,278 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-09 05:57:58,279 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-09 05:57:58,279 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-09 05:57:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 05:57:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-09 05:57:58,284 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-09 05:57:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-03-09 05:57:58,284 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 29 [2025-03-09 05:57:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:58,284 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-03-09 05:57:58,285 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-09 05:57:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-03-09 05:57:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 05:57:58,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:58,285 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-09 05:57:58,321 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-09 05:57:58,488 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-09 05:57:58,488 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-09 05:57:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 611502160, now seen corresponding path program 1 times [2025-03-09 05:57:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461036558] [2025-03-09 05:57:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:58,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:58,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:58,491 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-09 05:57:58,492 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-09 05:57:58,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 05:57:59,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 05:57:59,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:59,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:59,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:59,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:59,336 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-09 05:57:59,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:59,394 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-09 05:57:59,394 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:57:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461036558] [2025-03-09 05:57:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461036558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:59,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:57:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:57:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983819641] [2025-03-09 05:57:59,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:59,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:57:59,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:57:59,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:57:59,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:59,396 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-09 05:57:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:59,610 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-03-09 05:57:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:59,612 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-09 05:57:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:59,614 INFO L225 Difference]: With dead ends: 79 [2025-03-09 05:57:59,615 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 05:57:59,615 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-09 05:57:59,615 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-09 05:57:59,616 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-09 05:57:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 05:57:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2025-03-09 05:57:59,619 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-09 05:57:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 05:57:59,619 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2025-03-09 05:57:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:59,620 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 05:57:59,620 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-09 05:57:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 05:57:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 05:57:59,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:59,620 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-09 05:57:59,650 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-09 05:57:59,821 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-09 05:57:59,821 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-09 05:57:59,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash -845650993, now seen corresponding path program 1 times [2025-03-09 05:57:59,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:57:59,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543642493] [2025-03-09 05:57:59,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:59,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:59,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:59,825 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-09 05:57:59,826 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-09 05:57:59,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 05:58:00,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 05:58:00,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:58:00,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:58:00,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:58:00,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:58:00,653 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-09 05:58:00,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:58:00,689 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-09 05:58:00,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:58:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543642493] [2025-03-09 05:58:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543642493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:58:00,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:58:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:58:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259655904] [2025-03-09 05:58:00,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:58:00,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:58:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:58:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:58:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:58:00,691 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-09 05:58:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:58:00,781 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-03-09 05:58:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:58:00,782 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-09 05:58:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:58:00,782 INFO L225 Difference]: With dead ends: 99 [2025-03-09 05:58:00,782 INFO L226 Difference]: Without dead ends: 60 [2025-03-09 05:58:00,783 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-09 05:58:00,783 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-09 05:58:00,783 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-09 05:58:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-09 05:58:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-09 05:58:00,787 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-09 05:58:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-09 05:58:00,788 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 39 [2025-03-09 05:58:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:58:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-09 05:58:00,788 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-09 05:58:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-09 05:58:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:58:00,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:58:00,791 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-09 05:58:00,824 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-09 05:58:00,991 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-09 05:58:00,991 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-09 05:58:00,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:58:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash -132248881, now seen corresponding path program 2 times [2025-03-09 05:58:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:58:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39297419] [2025-03-09 05:58:00,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:58:00,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:58:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:58:00,995 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-09 05:58:00,995 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-09 05:58:01,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 05:59:09,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:59:09,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:59:09,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:09,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:59:09,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:59:09,707 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-09 05:59:09,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:59:09,743 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-09 05:59:09,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:59:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39297419] [2025-03-09 05:59:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39297419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:59:09,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:59:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:59:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404950965] [2025-03-09 05:59:09,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:59:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:59:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:59:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:59:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:59:09,746 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) [2025-03-09 05:59:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:09,958 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-03-09 05:59:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:59:09,959 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 51 [2025-03-09 05:59:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:09,960 INFO L225 Difference]: With dead ends: 101 [2025-03-09 05:59:09,960 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 05:59:09,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 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-09 05:59:09,960 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:09,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:59:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 05:59:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-09 05:59:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 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-09 05:59:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-03-09 05:59:09,964 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 51 [2025-03-09 05:59:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:09,965 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-03-09 05:59:09,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-03-09 05:59:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-03-09 05:59:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:59:09,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:09,965 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:10,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 05:59:10,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:10,166 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-09 05:59:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash -713230385, now seen corresponding path program 3 times [2025-03-09 05:59:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:59:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005273485] [2025-03-09 05:59:10,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:59:10,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:10,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:10,169 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:59:10,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:59:10,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 8 equivalence classes.