./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.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_operatoramount_amount10_file-13.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 d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:15:27,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:15:27,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:15:27,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:15:27,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:15:27,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:15:27,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:15:27,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:15:27,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:15:27,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:15:27,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:15:27,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:15:27,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:15:27,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:15:27,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:15:27,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:27,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:27,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:27,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:15:27,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:15:27,596 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 -> d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d [2025-01-09 14:15:27,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:15:27,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:15:27,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:15:27,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:15:27,873 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:15:27,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2025-01-09 14:15:29,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee568b5d/13838de26be14376a3e158a9c6facc30/FLAG28e738cff [2025-01-09 14:15:29,428 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:15:29,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2025-01-09 14:15:29,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee568b5d/13838de26be14376a3e158a9c6facc30/FLAG28e738cff [2025-01-09 14:15:29,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee568b5d/13838de26be14376a3e158a9c6facc30 [2025-01-09 14:15:29,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:15:29,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:15:29,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:29,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:15:29,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:15:29,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29, skipping insertion in model container [2025-01-09 14:15:29,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:15:29,607 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_operatoramount_amount10_file-13.i[915,928] [2025-01-09 14:15:29,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:29,652 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:15:29,663 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_operatoramount_amount10_file-13.i[915,928] [2025-01-09 14:15:29,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:29,691 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:15:29,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29 WrapperNode [2025-01-09 14:15:29,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:29,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:29,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:15:29,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:15:29,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,724 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-01-09 14:15:29,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:29,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:15:29,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:15:29,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:15:29,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,755 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 14:15:29,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:15:29,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:15:29,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:15:29,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:15:29,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (1/1) ... [2025-01-09 14:15:29,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:29,797 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 14:15:29,800 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 14:15:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:15:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:15:29,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:15:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:15:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:15:29,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:15:29,888 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:15:29,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:15:30,075 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 14:15:30,076 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:15:30,089 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:15:30,091 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:15:30,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:30 BoogieIcfgContainer [2025-01-09 14:15:30,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:15:30,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:15:30,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:15:30,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:15:30,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:15:29" (1/3) ... [2025-01-09 14:15:30,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b42014f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:30, skipping insertion in model container [2025-01-09 14:15:30,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:29" (2/3) ... [2025-01-09 14:15:30,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b42014f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:30, skipping insertion in model container [2025-01-09 14:15:30,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:30" (3/3) ... [2025-01-09 14:15:30,103 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-13.i [2025-01-09 14:15:30,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:15:30,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-13.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:15:30,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:15:30,184 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;@746cdac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:15:30,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:15:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:15:30,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:30,198 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:30,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:30,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1660595431, now seen corresponding path program 1 times [2025-01-09 14:15:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140834594] [2025-01-09 14:15:30,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:30,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:15:30,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:15:30,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:30,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:15:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140834594] [2025-01-09 14:15:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140834594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407734567] [2025-01-09 14:15:30,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:30,416 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 14:15:30,419 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 14:15:30,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:15:30,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:15:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:30,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:15:30,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:15:30,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:15:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407734567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:15:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907670342] [2025-01-09 14:15:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:15:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:30,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:15:30,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:15:30,609 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:15:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:30,626 INFO L93 Difference]: Finished difference Result 86 states and 137 transitions. [2025-01-09 14:15:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:15:30,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2025-01-09 14:15:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:30,635 INFO L225 Difference]: With dead ends: 86 [2025-01-09 14:15:30,636 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 14:15:30,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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 14:15:30,641 INFO L435 NwaCegarLoop]: 60 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, 60 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 14:15:30,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 14:15:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 14:15:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-01-09 14:15:30,673 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 78 [2025-01-09 14:15:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-01-09 14:15:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:15:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-01-09 14:15:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:15:30,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:30,676 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:30,683 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 14:15:30,877 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 14:15:30,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1179089689, now seen corresponding path program 1 times [2025-01-09 14:15:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773609678] [2025-01-09 14:15:30,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:30,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:15:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:15:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:15:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773609678] [2025-01-09 14:15:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773609678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720838785] [2025-01-09 14:15:31,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:31,228 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 14:15:31,231 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 14:15:31,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:15:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:15:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:31,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:15:31,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:31,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:15:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720838785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-01-09 14:15:31,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844882865] [2025-01-09 14:15:31,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:31,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:15:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:31,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:15:31,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:15:31,400 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:31,436 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-01-09 14:15:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:15:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2025-01-09 14:15:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:31,438 INFO L225 Difference]: With dead ends: 48 [2025-01-09 14:15:31,439 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 14:15:31,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:15:31,440 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:31,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 14:15:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 14:15:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-01-09 14:15:31,452 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 78 [2025-01-09 14:15:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:31,454 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-01-09 14:15:31,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-01-09 14:15:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 14:15:31,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:31,457 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:31,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:15:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:31,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1314632076, now seen corresponding path program 1 times [2025-01-09 14:15:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-01-09 14:15:31,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:31,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 14:15:31,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 14:15:31,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:31,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:31,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-01-09 14:15:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003626881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:31,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:31,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:15:31,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159568099] [2025-01-09 14:15:31,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:31,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:15:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:31,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:15:31,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:15:31,783 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:31,805 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2025-01-09 14:15:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:15:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2025-01-09 14:15:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:31,806 INFO L225 Difference]: With dead ends: 94 [2025-01-09 14:15:31,807 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 14:15:31,807 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 14:15:31,807 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:31,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 14:15:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-01-09 14:15:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-01-09 14:15:31,813 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 80 [2025-01-09 14:15:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:31,813 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-01-09 14:15:31,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-01-09 14:15:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 14:15:31,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:31,814 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:31,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:15:31,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:31,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash -990107634, now seen corresponding path program 1 times [2025-01-09 14:15:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638077743] [2025-01-09 14:15:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:31,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 14:15:31,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 14:15:31,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638077743] [2025-01-09 14:15:32,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638077743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:32,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:32,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:15:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648661428] [2025-01-09 14:15:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:32,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:15:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:32,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:15:32,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:15:32,688 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:32,995 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2025-01-09 14:15:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:15:32,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-01-09 14:15:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:32,997 INFO L225 Difference]: With dead ends: 78 [2025-01-09 14:15:32,997 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 14:15:32,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:15:32,998 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 28 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:32,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 419 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:15:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 14:15:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-01-09 14:15:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 14:15:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-01-09 14:15:33,015 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 82 [2025-01-09 14:15:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:33,016 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-01-09 14:15:33,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-01-09 14:15:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 14:15:33,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:33,020 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:33,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:15:33,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:33,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1085426944, now seen corresponding path program 1 times [2025-01-09 14:15:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631532765] [2025-01-09 14:15:33,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:33,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 14:15:33,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 14:15:33,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:33,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:33,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631532765] [2025-01-09 14:15:33,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631532765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:33,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:33,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:15:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466668800] [2025-01-09 14:15:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:33,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:15:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:33,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:15:33,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:15:33,085 INFO L87 Difference]: Start difference. First operand 70 states and 92 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:33,124 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2025-01-09 14:15:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:15:33,124 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-01-09 14:15:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:33,129 INFO L225 Difference]: With dead ends: 158 [2025-01-09 14:15:33,130 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 14:15:33,131 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 14:15:33,131 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:33,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 14:15:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-01-09 14:15:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 68 states have internal predecessors, (78), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:15:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-01-09 14:15:33,141 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 83 [2025-01-09 14:15:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-01-09 14:15:33,142 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-01-09 14:15:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 14:15:33,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:33,143 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:15:33,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:33,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1904659137, now seen corresponding path program 1 times [2025-01-09 14:15:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573800168] [2025-01-09 14:15:33,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:33,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 14:15:33,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 14:15:33,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:33,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:33,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573800168] [2025-01-09 14:15:33,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573800168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:33,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:33,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:15:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433762154] [2025-01-09 14:15:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:33,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:15:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:33,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:15:33,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:15:33,889 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:34,288 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2025-01-09 14:15:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:15:34,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-01-09 14:15:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:34,290 INFO L225 Difference]: With dead ends: 113 [2025-01-09 14:15:34,290 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 14:15:34,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:15:34,292 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:34,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 474 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:15:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 14:15:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2025-01-09 14:15:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 68 states have internal predecessors, (78), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:15:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-01-09 14:15:34,311 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 83 [2025-01-09 14:15:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:34,312 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-01-09 14:15:34,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-01-09 14:15:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 14:15:34,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:34,314 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:34,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:15:34,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:34,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1224600767, now seen corresponding path program 1 times [2025-01-09 14:15:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316900272] [2025-01-09 14:15:34,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:34,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 14:15:34,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 14:15:34,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:34,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:34,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:34,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316900272] [2025-01-09 14:15:34,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316900272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:34,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:15:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361088907] [2025-01-09 14:15:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:34,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:15:34,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:34,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:15:34,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:15:34,844 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:35,029 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-01-09 14:15:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:15:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-01-09 14:15:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:35,031 INFO L225 Difference]: With dead ends: 138 [2025-01-09 14:15:35,031 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 14:15:35,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:15:35,034 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:35,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 404 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:15:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 14:15:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2025-01-09 14:15:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 94 states have internal predecessors, (104), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 14:15:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 160 transitions. [2025-01-09 14:15:35,052 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 160 transitions. Word has length 83 [2025-01-09 14:15:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:35,053 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 160 transitions. [2025-01-09 14:15:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2025-01-09 14:15:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 14:15:35,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:35,054 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:35,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:15:35,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:35,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -864878262, now seen corresponding path program 1 times [2025-01-09 14:15:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291153726] [2025-01-09 14:15:35,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:35,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 14:15:35,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 14:15:35,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:35,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:15:35,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291153726] [2025-01-09 14:15:35,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291153726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:35,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:15:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127436292] [2025-01-09 14:15:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:35,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:15:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:15:35,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:15:35,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:15:35,105 INFO L87 Difference]: Start difference. First operand 124 states and 160 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:35,146 INFO L93 Difference]: Finished difference Result 257 states and 328 transitions. [2025-01-09 14:15:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:15:35,147 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-01-09 14:15:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:35,149 INFO L225 Difference]: With dead ends: 257 [2025-01-09 14:15:35,150 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 14:15:35,151 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 14:15:35,153 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 104 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 14:15:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2025-01-09 14:15:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 88 states have internal predecessors, (96), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:15:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2025-01-09 14:15:35,175 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 83 [2025-01-09 14:15:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:35,176 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2025-01-09 14:15:35,176 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2025-01-09 14:15:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 14:15:35,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:35,178 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:15:35,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash 672570180, now seen corresponding path program 1 times [2025-01-09 14:15:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:15:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837625440] [2025-01-09 14:15:35,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:35,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:15:35,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 14:15:35,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 14:15:35,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:35,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:15:35,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:15:35,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 14:15:35,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 14:15:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:15:35,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:15:35,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:15:35,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:15:35,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:15:35,266 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:15:35,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:15:35,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:15:35 BoogieIcfgContainer [2025-01-09 14:15:35,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:15:35,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:15:35,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:15:35,328 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:15:35,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:30" (3/4) ... [2025-01-09 14:15:35,331 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:15:35,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:15:35,333 INFO L158 Benchmark]: Toolchain (without parser) took 5877.68ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.4MB in the beginning and 173.6MB in the end (delta: -67.2MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:35,334 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:35,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.35ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:35,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:35,335 INFO L158 Benchmark]: Boogie Preprocessor took 36.71ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 92.0MB in the end (delta: 992.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:35,335 INFO L158 Benchmark]: RCFGBuilder took 325.75ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 77.5MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:35,336 INFO L158 Benchmark]: TraceAbstraction took 5232.18ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.5MB in the beginning and 173.7MB in the end (delta: -96.1MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2025-01-09 14:15:35,337 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 335.5MB. Free memory was 173.7MB in the beginning and 173.6MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:35,338 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.28ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.35ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.71ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 92.0MB in the end (delta: 992.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.75ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 77.5MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5232.18ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.5MB in the beginning and 173.7MB in the end (delta: -96.1MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 335.5MB. Free memory was 173.7MB in the beginning and 173.6MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 69, overapproximation of shiftRight at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 256; [L25] signed long int var_1_4 = 500; [L26] signed char var_1_5 = 16; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 1; VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L73] isInitial = 1 [L74] FCALL initially() [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L50] var_1_3 = __VERIFIER_nondet_ushort() [L51] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L51] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L52] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L52] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L53] var_1_4 = __VERIFIER_nondet_long() [L54] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L54] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L55] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L55] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L56] var_1_5 = __VERIFIER_nondet_char() [L57] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L57] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L58] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L58] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L59] var_1_6 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_7=1] [L60] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_7=1] [L61] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L61] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L62] var_1_7 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1] [L63] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1] [L64] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L64] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L77] RET updateVariables() [L78] CALL step() [L32] signed long int stepLocal_1 = ~ var_1_3; [L33] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L34] COND TRUE \read(var_1_2) VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L35] EXPR var_1_4 >> var_1_5 VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L35] COND FALSE !(stepLocal_1 != (var_1_4 >> var_1_5)) [L42] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_0=-255, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L78] RET step() [L79] CALL, EXPR property() [L69] EXPR var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L69] EXPR var_1_4 >> var_1_5 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L69] EXPR var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L69-L70] return var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 ; [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] [L19] reach_error() VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 1916 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1386 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 530 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=7, InterpolantAutomatonStates: 51, 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, 8 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 796 ConstructedInterpolants, 0 QuantifiedInterpolants, 1463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2585/2640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:15:35,359 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_operatoramount_amount10_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:15:37,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:15:37,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:15:37,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:15:37,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:15:37,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:15:37,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:15:37,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:15:37,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:15:37,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:15:37,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:15:37,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:15:37,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:15:37,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:15:37,763 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:15:37,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:15:37,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:15:37,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:37,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:15:37,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:37,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:15:37,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:15:37,768 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:15:37,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:15:37,768 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:15:37,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:15:37,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:15:37,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:15:37,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:15:37,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:15:37,769 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 -> d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d [2025-01-09 14:15:38,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:15:38,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:15:38,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:15:38,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:15:38,069 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:15:38,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2025-01-09 14:15:39,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/379871edb/16efb9fbce18456a9c288df3633e181e/FLAG15abe691d [2025-01-09 14:15:39,606 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:15:39,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2025-01-09 14:15:39,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/379871edb/16efb9fbce18456a9c288df3633e181e/FLAG15abe691d [2025-01-09 14:15:39,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/379871edb/16efb9fbce18456a9c288df3633e181e [2025-01-09 14:15:39,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:15:39,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:15:39,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:39,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:15:39,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:15:39,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d790076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:39, skipping insertion in model container [2025-01-09 14:15:39,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:15:39" (1/1) ... [2025-01-09 14:15:39,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:15:40,066 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_operatoramount_amount10_file-13.i[915,928] [2025-01-09 14:15:40,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:40,101 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:15:40,110 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_operatoramount_amount10_file-13.i[915,928] [2025-01-09 14:15:40,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:15:40,140 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:15:40,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40 WrapperNode [2025-01-09 14:15:40,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:15:40,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:40,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:15:40,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:15:40,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,183 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2025-01-09 14:15:40,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:15:40,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:15:40,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:15:40,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:15:40,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,217 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 14:15:40,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:15:40,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:15:40,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:15:40,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:15:40,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (1/1) ... [2025-01-09 14:15:40,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:15:40,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:40,285 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 14:15:40,291 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 14:15:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:15:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:15:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:15:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:15:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:15:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:15:40,382 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:15:40,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:15:40,530 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:15:40,530 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:15:40,540 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:15:40,540 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:15:40,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:40 BoogieIcfgContainer [2025-01-09 14:15:40,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:15:40,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:15:40,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:15:40,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:15:40,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:15:39" (1/3) ... [2025-01-09 14:15:40,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9276ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:40, skipping insertion in model container [2025-01-09 14:15:40,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:15:40" (2/3) ... [2025-01-09 14:15:40,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9276ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:15:40, skipping insertion in model container [2025-01-09 14:15:40,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:40" (3/3) ... [2025-01-09 14:15:40,553 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-13.i [2025-01-09 14:15:40,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:15:40,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-13.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:15:40,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:15:40,611 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;@25dc688e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:15:40,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:15:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 14:15:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:40,625 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:40,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1828616869, now seen corresponding path program 1 times [2025-01-09 14:15:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001304024] [2025-01-09 14:15:40,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:40,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:40,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:40,640 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 14:15:40,641 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 14:15:40,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 14:15:40,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 14:15:40,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:40,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:15:40,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:15:40,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:15:40,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001304024] [2025-01-09 14:15:40,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001304024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:40,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:40,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:15:40,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331429311] [2025-01-09 14:15:40,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:15:40,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:40,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:15:40,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:15:40,805 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:15:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:40,828 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2025-01-09 14:15:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:15:40,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2025-01-09 14:15:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:40,837 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:15:40,837 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 14:15:40,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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 14:15:40,845 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:40,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 14:15:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 14:15:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2025-01-09 14:15:40,891 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 76 [2025-01-09 14:15:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:40,891 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2025-01-09 14:15:40,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:15:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2025-01-09 14:15:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 14:15:40,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:40,896 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:40,904 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 14:15:41,096 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 [2025-01-09 14:15:41,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:41,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1353360037, now seen corresponding path program 1 times [2025-01-09 14:15:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026260093] [2025-01-09 14:15:41,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:41,101 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 14:15:41,102 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 14:15:41,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 14:15:41,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 14:15:41,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:41,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:41,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:15:41,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:42,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:15:42,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026260093] [2025-01-09 14:15:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026260093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:15:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:15:42,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:15:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828474223] [2025-01-09 14:15:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:15:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:42,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:15:42,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:15:42,179 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:42,235 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-01-09 14:15:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:15:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2025-01-09 14:15:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:42,236 INFO L225 Difference]: With dead ends: 44 [2025-01-09 14:15:42,237 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 14:15:42,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:15:42,238 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:42,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 188 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:15:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 14:15:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2025-01-09 14:15:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:15:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-01-09 14:15:42,250 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 76 [2025-01-09 14:15:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:42,252 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-01-09 14:15:42,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-01-09 14:15:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 14:15:42,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:42,254 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:42,264 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 14:15:42,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:42,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:42,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1401000004, now seen corresponding path program 1 times [2025-01-09 14:15:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192556873] [2025-01-09 14:15:42,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:42,460 INFO L229 MonitoredProcess]: Starting monitored process 4 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 14:15:42,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:15:42,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 14:15:42,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 14:15:42,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:42,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:42,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:15:42,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:15:43,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:15:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:43,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192556873] [2025-01-09 14:15:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192556873] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:43,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:43,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-01-09 14:15:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759564643] [2025-01-09 14:15:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:43,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:15:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:43,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:15:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:15:43,417 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:43,576 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2025-01-09 14:15:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:15:43,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2025-01-09 14:15:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:43,578 INFO L225 Difference]: With dead ends: 54 [2025-01-09 14:15:43,578 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 14:15:43,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:15:43,579 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 14 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:43,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 245 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:15:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 14:15:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-01-09 14:15:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 14:15:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2025-01-09 14:15:43,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 77 [2025-01-09 14:15:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:43,596 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2025-01-09 14:15:43,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2025-01-09 14:15:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:15:43,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:43,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:43,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:15:43,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:43,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:43,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash -719658054, now seen corresponding path program 1 times [2025-01-09 14:15:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750348732] [2025-01-09 14:15:43,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:43,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:43,809 INFO L229 MonitoredProcess]: Starting monitored process 5 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 14:15:43,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:15:43,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:15:43,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:15:43,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:43,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:43,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:15:43,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:15:44,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:15:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:44,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750348732] [2025-01-09 14:15:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750348732] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-01-09 14:15:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520711340] [2025-01-09 14:15:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:15:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:44,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:15:44,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:15:44,666 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:45,046 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2025-01-09 14:15:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:15:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2025-01-09 14:15:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:45,049 INFO L225 Difference]: With dead ends: 71 [2025-01-09 14:15:45,049 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 14:15:45,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:15:45,051 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 22 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:45,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 253 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:15:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 14:15:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2025-01-09 14:15:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 14:15:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2025-01-09 14:15:45,060 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 78 [2025-01-09 14:15:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:45,061 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2025-01-09 14:15:45,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2025-01-09 14:15:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:15:45,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:15:45,062 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:45,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:15:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:45,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:15:45,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:15:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -717811012, now seen corresponding path program 1 times [2025-01-09 14:15:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:15:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809856348] [2025-01-09 14:15:45,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:15:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:15:45,270 INFO L229 MonitoredProcess]: Starting monitored process 6 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 14:15:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:15:45,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:15:45,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:15:45,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:15:45,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:15:45,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:15:45,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:15:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 14:15:45,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:15:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:15:45,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:15:45,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809856348] [2025-01-09 14:15:45,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809856348] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:15:45,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:15:45,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-01-09 14:15:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781021057] [2025-01-09 14:15:45,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:15:45,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:15:45,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:15:45,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:15:45,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:15:45,906 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:15:46,250 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2025-01-09 14:15:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:15:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2025-01-09 14:15:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:15:46,252 INFO L225 Difference]: With dead ends: 62 [2025-01-09 14:15:46,252 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:15:46,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:15:46,254 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:15:46,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 252 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:15:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:15:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:15:46,254 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 14:15:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:15:46,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-01-09 14:15:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:15:46,255 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:15:46,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:15:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:15:46,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:15:46,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:15:46,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:15:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:15:46,464 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 14:15:46,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:15:46,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:15:46,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:15:46 BoogieIcfgContainer [2025-01-09 14:15:46,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:15:46,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:15:46,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:15:46,588 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:15:46,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:15:40" (3/4) ... [2025-01-09 14:15:46,590 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:15:46,595 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:15:46,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 14:15:46,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:15:46,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:15:46,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:15:46,679 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:15:46,679 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:15:46,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:15:46,680 INFO L158 Benchmark]: Toolchain (without parser) took 6747.50ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 92.4MB in the beginning and 103.6MB in the end (delta: -11.2MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2025-01-09 14:15:46,681 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:46,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.61ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:46,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.11ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:46,682 INFO L158 Benchmark]: Boogie Preprocessor took 64.11ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:15:46,682 INFO L158 Benchmark]: RCFGBuilder took 292.24ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 64.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:46,683 INFO L158 Benchmark]: TraceAbstraction took 6044.24ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 64.1MB in the beginning and 109.8MB in the end (delta: -45.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-01-09 14:15:46,683 INFO L158 Benchmark]: Witness Printer took 91.94ms. Allocated memory is still 192.9MB. Free memory was 109.8MB in the beginning and 103.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:15:46,684 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.20ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.61ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.11ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.11ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 292.24ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 64.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6044.24ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 64.1MB in the beginning and 109.8MB in the end (delta: -45.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 91.94ms. Allocated memory is still 192.9MB. Free memory was 109.8MB in the beginning and 103.6MB in the end (delta: 6.2MB). 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 721 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 267 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 573 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 29, 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, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 610 ConstructedInterpolants, 6 QuantifiedInterpolants, 1085 SizeOfPredicates, 38 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2058/2112 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 RESULT: Ultimate proved your program to be correct! [2025-01-09 14:15:46,702 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