./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:14:53,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:14:53,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:14:53,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:14:53,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:14:53,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:14:53,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:14:53,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:14:53,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:14:53,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:14:53,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:14:53,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:14:53,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:14:53,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:14:53,776 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:14:53,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:14:53,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:14:53,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:14:53,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:53,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:53,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:14:53,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:14:53,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:14:53,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:14:53,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:14:53,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b [2025-01-09 13:14:53,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:14:53,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:14:53,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:14:53,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:14:53,997 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:14:53,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i [2025-01-09 13:14:55,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7410f97a5/96da0468a0e343688638a290119b98b2/FLAGe4b0b7327 [2025-01-09 13:14:55,345 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:14:55,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i [2025-01-09 13:14:55,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7410f97a5/96da0468a0e343688638a290119b98b2/FLAGe4b0b7327 [2025-01-09 13:14:55,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7410f97a5/96da0468a0e343688638a290119b98b2 [2025-01-09 13:14:55,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:14:55,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:14:55,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:14:55,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:14:55,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:14:55,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ade8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55, skipping insertion in model container [2025-01-09 13:14:55,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:14:55,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i[915,928] [2025-01-09 13:14:55,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:14:55,837 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:14:55,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i[915,928] [2025-01-09 13:14:55,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:14:55,877 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:14:55,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55 WrapperNode [2025-01-09 13:14:55,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:14:55,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:14:55,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:14:55,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:14:55,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,906 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 13:14:55,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:14:55,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:14:55,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:14:55,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:14:55,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,933 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:14:55,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:14:55,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:14:55,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:14:55,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:14:55,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (1/1) ... [2025-01-09 13:14:55,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:14:55,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:14:55,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:14:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:14:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:14:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:14:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:14:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:14:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:14:56,047 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:14:56,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:14:56,241 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 13:14:56,241 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:14:56,250 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:14:56,250 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:14:56,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:56 BoogieIcfgContainer [2025-01-09 13:14:56,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:14:56,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:14:56,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:14:56,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:14:56,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:14:55" (1/3) ... [2025-01-09 13:14:56,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fecc276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:14:56, skipping insertion in model container [2025-01-09 13:14:56,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:55" (2/3) ... [2025-01-09 13:14:56,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fecc276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:14:56, skipping insertion in model container [2025-01-09 13:14:56,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:56" (3/3) ... [2025-01-09 13:14:56,258 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-14.i [2025-01-09 13:14:56,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:14:56,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-14.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:14:56,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:14:56,322 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;@1f9ff748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:14:56,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:14:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:14:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:14:56,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:56,335 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:14:56,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1412737205, now seen corresponding path program 1 times [2025-01-09 13:14:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:14:56,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474414176] [2025-01-09 13:14:56,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:14:56,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:14:56,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:14:56,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:56,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:14:56,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:14:56,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474414176] [2025-01-09 13:14:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474414176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:14:56,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817918826] [2025-01-09 13:14:56,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:56,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:14:56,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:14:56,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:14:56,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:14:56,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:14:56,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:14:56,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:56,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:56,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:14:56,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:14:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:14:56,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:14:56,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817918826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:14:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:14:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:14:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863024214] [2025-01-09 13:14:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:14:56,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:14:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:14:56,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:14:56,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:14:56,668 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:14:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:14:56,687 INFO L93 Difference]: Finished difference Result 97 states and 157 transitions. [2025-01-09 13:14:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:14:56,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-01-09 13:14:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:14:56,692 INFO L225 Difference]: With dead ends: 97 [2025-01-09 13:14:56,693 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 13:14:56,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-01-09 13:14:56,698 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:14:56,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:14:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 13:14:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 13:14:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:14:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2025-01-09 13:14:56,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 104 [2025-01-09 13:14:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:14:56,731 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2025-01-09 13:14:56,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:14:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2025-01-09 13:14:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:14:56,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:56,735 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:14:56,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:14:56,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:14:56,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1045809333, now seen corresponding path program 1 times [2025-01-09 13:14:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:14:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105660501] [2025-01-09 13:14:56,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:14:56,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:14:56,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:14:56,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:56,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:14:57,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:14:57,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105660501] [2025-01-09 13:14:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105660501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:14:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:14:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:14:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526938427] [2025-01-09 13:14:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:14:57,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:14:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:14:57,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:14:57,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:14:57,301 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:14:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:14:57,407 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2025-01-09 13:14:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:14:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-01-09 13:14:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:14:57,410 INFO L225 Difference]: With dead ends: 146 [2025-01-09 13:14:57,410 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 13:14:57,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-09 13:14:57,411 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:14:57,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 180 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:14:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 13:14:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2025-01-09 13:14:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:14:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2025-01-09 13:14:57,431 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 104 [2025-01-09 13:14:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:14:57,431 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2025-01-09 13:14:57,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:14:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2025-01-09 13:14:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:14:57,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:57,433 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:14:57,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:14:57,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:57,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1430262607, now seen corresponding path program 1 times [2025-01-09 13:14:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:14:57,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-01-09 13:14:57,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:14:57,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:14:57,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:14:57,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:57,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-01-09 13:15:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057101998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:15:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425387278] [2025-01-09 13:15:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:00,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:15:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:00,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:15:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:15:00,112 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:00,629 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2025-01-09 13:15:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:15:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-01-09 13:15:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:00,632 INFO L225 Difference]: With dead ends: 99 [2025-01-09 13:15:00,632 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 13:15:00,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:15:00,632 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:00,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 267 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:15:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 13:15:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2025-01-09 13:15:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 13:15:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-01-09 13:15:00,647 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 104 [2025-01-09 13:15:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:00,649 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-01-09 13:15:00,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-01-09 13:15:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:15:00,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:00,651 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:15:00,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1432109649, now seen corresponding path program 1 times [2025-01-09 13:15:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836830577] [2025-01-09 13:15:00,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:00,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:15:00,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:15:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836830577] [2025-01-09 13:15:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836830577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:00,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:00,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:15:00,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837279440] [2025-01-09 13:15:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:00,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:15:00,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:00,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:15:00,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:00,735 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:00,833 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-01-09 13:15:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:15:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-01-09 13:15:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:00,835 INFO L225 Difference]: With dead ends: 222 [2025-01-09 13:15:00,835 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 13:15:00,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:15:00,836 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 47 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:00,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 217 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 13:15:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-01-09 13:15:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 79 states have internal predecessors, (92), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 13:15:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-01-09 13:15:00,848 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 104 [2025-01-09 13:15:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:00,849 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-01-09 13:15:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2025-01-09 13:15:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:15:00,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:00,849 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:00,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:15:00,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1035920545, now seen corresponding path program 1 times [2025-01-09 13:15:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-01-09 13:15:00,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:15:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:15:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:03,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-01-09 13:15:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923784749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:03,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:03,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:15:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611404620] [2025-01-09 13:15:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:03,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:15:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:03,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:15:03,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:15:03,060 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:03,423 INFO L93 Difference]: Finished difference Result 161 states and 223 transitions. [2025-01-09 13:15:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:15:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2025-01-09 13:15:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:03,425 INFO L225 Difference]: With dead ends: 161 [2025-01-09 13:15:03,425 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 13:15:03,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:15:03,426 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:03,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 278 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 13:15:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2025-01-09 13:15:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1818181818181819) internal successors, (104), 88 states have internal predecessors, (104), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 13:15:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2025-01-09 13:15:03,441 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 105 [2025-01-09 13:15:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:03,442 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2025-01-09 13:15:03,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2025-01-09 13:15:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:15:03,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:03,443 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:03,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:15:03,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash 739086817, now seen corresponding path program 1 times [2025-01-09 13:15:03,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257441671] [2025-01-09 13:15:03,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:15:03,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:15:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:15:06,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257441671] [2025-01-09 13:15:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257441671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:06,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:15:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952762194] [2025-01-09 13:15:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:06,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:15:06,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:06,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:15:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:15:06,107 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:07,036 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2025-01-09 13:15:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:15:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2025-01-09 13:15:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:07,037 INFO L225 Difference]: With dead ends: 172 [2025-01-09 13:15:07,037 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 13:15:07,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:15:07,038 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 378 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:15:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 13:15:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2025-01-09 13:15:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 13:15:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2025-01-09 13:15:07,057 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 105 [2025-01-09 13:15:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2025-01-09 13:15:07,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:15:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2025-01-09 13:15:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 13:15:07,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:07,060 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:15:07,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash 742229836, now seen corresponding path program 1 times [2025-01-09 13:15:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:07,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691881056] [2025-01-09 13:15:07,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:07,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 13:15:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 13:15:07,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:07,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 13:15:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691881056] [2025-01-09 13:15:07,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691881056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:15:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211908299] [2025-01-09 13:15:07,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:07,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:15:07,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:15:07,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 13:15:07,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 13:15:07,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:07,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:07,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:15:07,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 1060 proven. 0 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2025-01-09 13:15:07,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211908299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:15:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 13:15:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431427974] [2025-01-09 13:15:07,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:15:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:07,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:15:07,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:07,313 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 13:15:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:07,349 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2025-01-09 13:15:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:15:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2025-01-09 13:15:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:07,350 INFO L225 Difference]: With dead ends: 204 [2025-01-09 13:15:07,350 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:15:07,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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-01-09 13:15:07,352 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:07,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:15:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:15:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 13:15:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:15:07,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2025-01-09 13:15:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:07,355 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:15:07,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 13:15:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:15:07,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:15:07,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:15:07,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:15:07,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:07,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:15:07,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 13:15:08,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:15:08,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:15:08 BoogieIcfgContainer [2025-01-09 13:15:08,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:15:08,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:15:08,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:15:08,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:15:08,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:56" (3/4) ... [2025-01-09 13:15:08,141 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 13:15:08,146 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 13:15:08,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 13:15:08,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 13:15:08,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 13:15:08,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 13:15:08,218 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 13:15:08,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 13:15:08,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:15:08,220 INFO L158 Benchmark]: Toolchain (without parser) took 12528.87ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 122.7MB in the beginning and 363.2MB in the end (delta: -240.4MB). Peak memory consumption was 303.6MB. Max. memory is 16.1GB. [2025-01-09 13:15:08,220 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:08,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.41ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:08,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.61ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:08,221 INFO L158 Benchmark]: Boogie Preprocessor took 44.80ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:08,221 INFO L158 Benchmark]: RCFGBuilder took 295.56ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 90.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:15:08,221 INFO L158 Benchmark]: TraceAbstraction took 11886.84ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 89.9MB in the beginning and 371.3MB in the end (delta: -281.4MB). Peak memory consumption was 261.7MB. Max. memory is 16.1GB. [2025-01-09 13:15:08,221 INFO L158 Benchmark]: Witness Printer took 79.28ms. Allocated memory is still 713.0MB. Free memory was 371.3MB in the beginning and 363.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:08,223 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.41ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.61ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.80ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.56ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 90.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11886.84ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 89.9MB in the beginning and 371.3MB in the end (delta: -281.4MB). Peak memory consumption was 261.7MB. Max. memory is 16.1GB. * Witness Printer took 79.28ms. Allocated memory is still 713.0MB. Free memory was 371.3MB in the beginning and 363.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 7, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 1516 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1073 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 774 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 443 mSDtfsCounter, 774 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 64 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1133 ConstructedInterpolants, 0 QuantifiedInterpolants, 4709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 728 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 7369/7400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((1 <= k_loop) && (((var_1_5 == last_1_var_1_12) && (last_1_var_1_9 != 0)) || ((last_1_var_1_9 == 0) && (((((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)) == var_1_5) && (((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)) <= 32767)) || (((65536 + var_1_5) == ((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536))) && (32768 <= ((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)))))))) || (((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (0 <= k_loop)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1))) RESULT: Ultimate proved your program to be correct! [2025-01-09 13:15:08,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE