./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-76.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_variablewrapping_normal_file-76.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 53f56ada378bb0c37d2572871baea3e6e471c6fc42badf64010dad779eb8adc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:14:21,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:14:21,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:14:21,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:14:21,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:14:21,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:14:21,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:14:21,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:14:21,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:14:21,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:14:21,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:14:21,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:14:21,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:14:21,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:14:21,127 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:14:21,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:14:21,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:14:21,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:21,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:21,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:21,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:14:21,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:14:21,131 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 -> 53f56ada378bb0c37d2572871baea3e6e471c6fc42badf64010dad779eb8adc8 [2025-01-09 15:14:21,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:14:21,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:14:21,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:14:21,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:14:21,374 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:14:21,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-76.i [2025-01-09 15:14:22,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2214c9877/de6ed1455ec54514b973eab6ea59f1e1/FLAGec86c535d [2025-01-09 15:14:22,740 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:14:22,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-76.i [2025-01-09 15:14:22,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2214c9877/de6ed1455ec54514b973eab6ea59f1e1/FLAGec86c535d [2025-01-09 15:14:23,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2214c9877/de6ed1455ec54514b973eab6ea59f1e1 [2025-01-09 15:14:23,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:14:23,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:14:23,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:23,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:14:23,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:14:23,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23, skipping insertion in model container [2025-01-09 15:14:23,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:14:23,176 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_variablewrapping_normal_file-76.i[913,926] [2025-01-09 15:14:23,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:23,219 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:14:23,230 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_variablewrapping_normal_file-76.i[913,926] [2025-01-09 15:14:23,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:23,269 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:14:23,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23 WrapperNode [2025-01-09 15:14:23,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:23,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:23,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:14:23,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:14:23,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,299 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-01-09 15:14:23,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:23,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:14:23,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:14:23,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:14:23,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,322 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 15:14:23,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:14:23,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:14:23,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:14:23,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:14:23,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (1/1) ... [2025-01-09 15:14:23,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:23,367 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 15:14:23,369 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 15:14:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:14:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:14:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:14:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:14:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:14:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:14:23,439 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:14:23,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:14:23,646 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 15:14:23,646 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:14:23,657 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:14:23,658 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:14:23,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:23 BoogieIcfgContainer [2025-01-09 15:14:23,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:14:23,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:14:23,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:14:23,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:14:23,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:23" (1/3) ... [2025-01-09 15:14:23,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1078efbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:23, skipping insertion in model container [2025-01-09 15:14:23,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:23" (2/3) ... [2025-01-09 15:14:23,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1078efbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:23, skipping insertion in model container [2025-01-09 15:14:23,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:23" (3/3) ... [2025-01-09 15:14:23,667 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-76.i [2025-01-09 15:14:23,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:14:23,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-76.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:14:23,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:14:23,742 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;@4d55a828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:14:23,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:14:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 15:14:23,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:23,757 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:23,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1246834536, now seen corresponding path program 1 times [2025-01-09 15:14:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796887452] [2025-01-09 15:14:23,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:23,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 15:14:23,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 15:14:23,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:23,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:14:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796887452] [2025-01-09 15:14:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796887452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:14:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636746568] [2025-01-09 15:14:23,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:23,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:14:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:23,988 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 15:14:23,991 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 15:14:24,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 15:14:24,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 15:14:24,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:24,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:24,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:14:24,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:14:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:14:24,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:14:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636746568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:14:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:14:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177062810] [2025-01-09 15:14:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:24,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:14:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:24,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:14:24,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:14:24,170 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:14:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:24,190 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2025-01-09 15:14:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:14:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-01-09 15:14:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:24,197 INFO L225 Difference]: With dead ends: 94 [2025-01-09 15:14:24,197 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 15:14:24,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 15:14:24,203 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:24,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:14:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 15:14:24,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 15:14:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-01-09 15:14:24,230 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 97 [2025-01-09 15:14:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:24,231 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-01-09 15:14:24,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:14:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-01-09 15:14:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:14:24,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:24,233 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:24,240 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 15:14:24,435 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 15:14:24,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:24,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 205508250, now seen corresponding path program 1 times [2025-01-09 15:14:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472776049] [2025-01-09 15:14:24,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:24,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:14:24,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:14:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:24,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472776049] [2025-01-09 15:14:24,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472776049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:24,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:14:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057101998] [2025-01-09 15:14:24,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:24,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:14:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:24,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:14:24,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:24,640 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:24,667 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2025-01-09 15:14:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:14:24,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-01-09 15:14:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:24,669 INFO L225 Difference]: With dead ends: 91 [2025-01-09 15:14:24,669 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 15:14:24,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:24,669 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:24,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:14:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 15:14:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 15:14:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2025-01-09 15:14:24,675 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 98 [2025-01-09 15:14:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:24,678 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2025-01-09 15:14:24,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2025-01-09 15:14:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 15:14:24,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:24,681 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:14:24,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -187518760, now seen corresponding path program 1 times [2025-01-09 15:14:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:24,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640906841] [2025-01-09 15:14:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:24,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 15:14:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 15:14:24,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:24,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640906841] [2025-01-09 15:14:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640906841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:24,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:24,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:14:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880157] [2025-01-09 15:14:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:24,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:14:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:24,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:14:24,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:24,843 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:24,871 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2025-01-09 15:14:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:14:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-01-09 15:14:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:24,874 INFO L225 Difference]: With dead ends: 91 [2025-01-09 15:14:24,874 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 15:14:24,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:14:24,875 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:24,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:14:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 15:14:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 15:14:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:14:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-01-09 15:14:24,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 98 [2025-01-09 15:14:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:24,881 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-01-09 15:14:24,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-01-09 15:14:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 15:14:24,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:24,882 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:24,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:14:24,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:24,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash -459555865, now seen corresponding path program 1 times [2025-01-09 15:14:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:24,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104658603] [2025-01-09 15:14:24,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:24,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 15:14:24,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 15:14:24,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:24,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104658603] [2025-01-09 15:14:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104658603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:25,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:25,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:14:25,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844659475] [2025-01-09 15:14:25,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:25,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:14:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:25,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:14:25,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:14:25,963 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:26,220 INFO L93 Difference]: Finished difference Result 129 states and 173 transitions. [2025-01-09 15:14:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:14:26,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-01-09 15:14:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:26,222 INFO L225 Difference]: With dead ends: 129 [2025-01-09 15:14:26,222 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 15:14:26,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:14:26,223 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:26,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 263 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:14:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 15:14:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2025-01-09 15:14:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.196078431372549) internal successors, (61), 52 states have internal predecessors, (61), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:14:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2025-01-09 15:14:26,241 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 99 [2025-01-09 15:14:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:26,242 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2025-01-09 15:14:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2025-01-09 15:14:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:14:26,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:26,243 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:26,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:14:26,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:26,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 923069714, now seen corresponding path program 1 times [2025-01-09 15:14:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:26,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109840723] [2025-01-09 15:14:26,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:26,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:26,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:26,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:26,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:14:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109840723] [2025-01-09 15:14:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109840723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:14:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168812705] [2025-01-09 15:14:26,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:26,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:14:26,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:26,423 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 15:14:26,425 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 15:14:26,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:26,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:26,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:26,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:26,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:14:26,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:14:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 15:14:26,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:14:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:14:26,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168812705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:14:26,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:14:26,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 15:14:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571900535] [2025-01-09 15:14:26,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:14:26,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:14:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:14:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:14:26,815 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 15:14:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:27,100 INFO L93 Difference]: Finished difference Result 185 states and 238 transitions. [2025-01-09 15:14:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:14:27,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 100 [2025-01-09 15:14:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:27,105 INFO L225 Difference]: With dead ends: 185 [2025-01-09 15:14:27,106 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:14:27,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:14:27,107 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 79 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:27,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 163 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:14:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:14:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2025-01-09 15:14:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:14:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-01-09 15:14:27,125 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 100 [2025-01-09 15:14:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:27,126 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-01-09 15:14:27,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 15:14:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2025-01-09 15:14:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:14:27,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:27,128 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:27,134 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 15:14:27,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:14:27,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:27,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash 353190426, now seen corresponding path program 1 times [2025-01-09 15:14:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029400829] [2025-01-09 15:14:27,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:27,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:14:27,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:14:27,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:27,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:14:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029400829] [2025-01-09 15:14:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029400829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:14:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874191593] [2025-01-09 15:14:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:14:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:14:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:14:28,056 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:28,194 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2025-01-09 15:14:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:14:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-01-09 15:14:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:28,195 INFO L225 Difference]: With dead ends: 83 [2025-01-09 15:14:28,195 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 15:14:28,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:14:28,196 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:28,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:14:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 15:14:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 15:14:28,197 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 15:14:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 15:14:28,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2025-01-09 15:14:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:28,197 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 15:14:28,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:14:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 15:14:28,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 15:14:28,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:14:28,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:14:28,201 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 15:14:28,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 15:14:28,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:14:28,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:14:28 BoogieIcfgContainer [2025-01-09 15:14:28,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:14:28,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:14:28,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:14:28,599 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:14:28,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:23" (3/4) ... [2025-01-09 15:14:28,601 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 15:14:28,605 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 15:14:28,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 15:14:28,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 15:14:28,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 15:14:28,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 15:14:28,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 15:14:28,670 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 15:14:28,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:14:28,670 INFO L158 Benchmark]: Toolchain (without parser) took 5607.47ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 132.8MB in the beginning and 192.3MB in the end (delta: -59.5MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2025-01-09 15:14:28,670 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:28,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.10ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:28,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.08ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:28,671 INFO L158 Benchmark]: Boogie Preprocessor took 32.09ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:28,671 INFO L158 Benchmark]: RCFGBuilder took 323.44ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 101.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:14:28,671 INFO L158 Benchmark]: TraceAbstraction took 4936.86ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 100.3MB in the beginning and 200.6MB in the end (delta: -100.3MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2025-01-09 15:14:28,671 INFO L158 Benchmark]: Witness Printer took 72.13ms. Allocated memory is still 234.9MB. Free memory was 200.6MB in the beginning and 192.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:28,672 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.14ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.10ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.08ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.09ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 323.44ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 101.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4936.86ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 100.3MB in the beginning and 200.6MB in the end (delta: -100.3MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. * Witness Printer took 72.13ms. Allocated memory is still 234.9MB. Free memory was 200.6MB in the beginning and 192.3MB in the end (delta: 8.3MB). 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: 4.5s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 603 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 400 IncrementalHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 385 mSDtfsCounter, 400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=4, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 59 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 789 NumberOfCodeBlocks, 789 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 880 ConstructedInterpolants, 0 QuantifiedInterpolants, 2051 SizeOfPredicates, 2 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 3671/3780 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: 106]: Loop Invariant Derived loop invariant: ((var_1_5 <= 0) && ((var_1_4 != var_1_10) || (((((240 + var_1_11) % 256) == var_1_8) || ((128 <= ((240 + var_1_11) % 256)) && (((240 + var_1_11) % 256) == (256 + var_1_8)))) && ((((240 + var_1_11) % 256) < 128) || (((240 + var_1_11) % 256) != var_1_8))))) RESULT: Ultimate proved your program to be correct! [2025-01-09 15:14:28,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE